Towards compatible triangulations

We 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.

[1]  Thorsten Graf,et al.  Reducing Simple Polygons to Triangles - A Proof for an Improved Conjecture , 1998, ICALP.

[2]  Boris Aronov,et al.  On Compatible Triangulations of Simple Polygons , 1993, Comput. Geom..

[3]  Oswin Aichholzer,et al.  The point set order type data base: A collection of applications and results , 2001, CCCG.

[4]  C. Gotsman,et al.  How to morph tilings injectively , 1999 .

[5]  Franz Aurenhammer,et al.  Enumerating Order Types for Small Point Sets with Applications , 2002, Order.

[6]  Franz Aurenhammer,et al.  Enumerating order types for small sets with applications , 2001, SCG '01.

[7]  Jorge Urrutia,et al.  Isomorphic Triangulations with Small Number of Steiner Points , 1999, Int. J. Comput. Geom. Appl..

[8]  Richard Pollack,et al.  Multidimensional Sorting , 1983, SIAM J. Comput..

[9]  Ömer Egecioglu,et al.  Visibility graphs of staircase polygons with uniform step length , 1993, Int. J. Comput. Geom. Appl..

[10]  Thaddeus Beier,et al.  Feature-based image metamorphosis , 1992, SIGGRAPH.

[11]  Leonidas J. Guibas,et al.  Morphing Simple Polygons , 1994, SCG '94.

[12]  Alan Saalfeld.  Joint triangulations and triangulation maps , 1987, SCG '87.

[13]  Peisheng Gao,et al.  2-D shape blending: an intrinsic solution to the vertex path problem , 1993, SIGGRAPH.

[14]  Craig Gotsman,et al.  Morphing Planar Triangulations and Polygons using Convex Representations , 2000, European Workshop on Computational Geometry.

[15]  Ari Rappoport,et al.  Shape blending using the star-skeleton representation , 1995, IEEE Computer Graphics and Applications.