4,113 research outputs found
Towards compatible triangulations
AbstractWe state the following conjecture: any two planar n-point sets that agree on the number of convex hull points can be triangulated in a compatible manner, i.e., such that the resulting two triangulations are topologically equivalent. We first describe a class of point sets which can be triangulated compatibly with any other set (that satisfies the obvious size and shape restrictions). The conjecture is then proved true for point sets with at most three interior points. Finally, we demonstrate that adding a small number of extraneous points (the number of interior points minus three) always allows for compatible triangulations. The linear bound extends to point sets of arbitrary size and shape
Veering triangulations admit strict angle structures
Agol recently introduced the concept of a veering taut triangulation, which
is a taut triangulation with some extra combinatorial structure. We define the
weaker notion of a "veering triangulation" and use it to show that all veering
triangulations admit strict angle structures. We also answer a question of
Agol, giving an example of a veering taut triangulation that is not layered.Comment: 15 pages, 9 figure
- …