Counting triangulations and pseudo-triangulations of wheels

Motivated by several open questions on triangulations and pseudotriangulations, we give closed form expressions for the number of triangulations and the number of minimum pseudo-triangulations of n points in wheel configurations, that is, with n− 1 in convex position. Although the numbers of triangulations and pseudotriangulations vary depending on the placement of the interior point, their difference is always the (n− 2)nd Catalan number. We also prove an inequality #PT ≤ 3#T for the numbers of minimum pseudo-triangulations and triangulations of any point configuration with i interior

[1]  W. T. Tutte,et al.  A Census of Planar Triangulations , 1962, Canadian Journal of Mathematics.

[2]  Ileana Streinu,et al.  A combinatorial approach to planar non-colliding robot arm motion planning , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[3]  Leonidas J. Guibas,et al.  Ray Shooting in Polygons Using Geodesic Triangulations , 1991, ICALP.

[4]  Bettina Speckmann,et al.  Kinetic collision detection for simple polygons , 2000, SCG '00.

[5]  Michael T. Goodrich,et al.  Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations , 1997, J. Algorithms.

[6]  Michel Pocchiola,et al.  Minimal Tangent Visibility Graphs , 1996, Comput. Geom..

[7]  Christian Sohler,et al.  Encoding a triangulation as a permutation of its point set , 1997, CCCG.

[8]  Leonidas J. Guibas,et al.  Deformable Free-Space Tilings for Kinetic Collision Detection† , 2002, Int. J. Robotics Res..

[9]  Sergei Bespamyatnikh,et al.  An efficient algorithm for enumeration of triangulations , 2002 .

[10]  Raimund Seidel,et al.  A better upper bound on the number of triangulations of a planar point set , 2003, J. Comb. Theory, Ser. A.

[11]  Shin-Ichi Nakano,et al.  Efficient Generation of Plane Triangulations without Repetitions , 2001, ICALP.

[12]  Bettina Speckmann,et al.  Separation Sensitive Kinetic Separation Structures for Convex Polygons , 2000, JCDCG.

[13]  Michel Pocchiola,et al.  Topologically sweeping visibility complexes via pseudotriangulations , 1996, Discret. Comput. Geom..