On the Number of Pseudo-Triangulations of Certain Point Sets
نویسندگان
چکیده
We pose a monotonicity conjecture on the number of pseudo-triangulations of any planar point set, and check it in two prominent families of point sets, namely the so-called double circle and double chain. The latter has asymptotically 12n pointed pseudo-triangulations, which lies significantly above the maximum number of triangulations in a planar point set known so far.
منابع مشابه
ar X iv : m at h / 06 01 74 7 v 2 [ m at h . C O ] 1 4 Ju n 20 07 On the Number of Pseudo - Triangulations of Certain Point Sets ⋆
We pose a monotonicity conjecture on the number of pseudo-triangulations of any planar point set, and check it on two prominent families of point sets, namely the so-called double circle and double chain. The latter has asymptotically 12nnΘ(1) pointed pseudo-triangulations, which lies significantly above the maximum number of triangulations in a planar point set known so far. ⋆ Parts of this wo...
متن کاملCounting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm
This paper studies (pointed, or minimal) pseudotriangulations for a given point set in the plane. Pseudotriangulations have many properties of triangulations, and have more freedom since polygons with more than three vertices are allowed as long as exactly three have angles less than π. In particular, there is a natural flip operation on every internal edge. We establish fundamental properties ...
متن کاملCounting and enumerating pseudo-triangulations with the greedy flip algorithm∗
This paper studies pseudo-triangulations for a given point set in the plane. Pseudo-triangulations have many properties of triangulations, and have more freedom since polygons with more than three vertices are allowed as long as they have exactly inner angles less than π. In particular, there is a natural flip operation on every internal edge. We establish fundamental properties of pseudo-trian...
متن کاملConvexity minimizes pseudo-triangulations
The number of minimum pseudo-triangulations is minimized for point sets in convex position.
متن کاملOn extreme points of the PPT Polytope
The polytope of pointed pseudo triangulations was described in [RSS01]. This polytope is a combinatorial tool to observe all possible pseudo triangulations of a certain point set. Each point of the polytope refers to one possible pseudo triangulation of the point set. To polytope vertices are connected by an edge if their pseudo triangulations just differ in one edge-flip. Once we have a PPT-po...
متن کامل