Pre-Triangulations and Liftable Complexes

We introduce and discuss the concept of pre-triangulations, a relaxation of triangulations that goes beyond the well-established class of pseudo-triangulations.

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

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

[3]  Francisco Santos,et al.  The polytope of non-crossing graphs on a planar point set , 2004, ISSAC '04.

[4]  D. Eppstein,et al.  MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .

[5]  Thomas Hackl.  Manipulation of Pseudo-Triangular Surfaces , 2004 .

[6]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[7]  Franz Aurenhammer,et al.  A criterion for the affine equivalence of cell complexes inRd and convex polyhedra inRd+1 , 1987, Discret. Comput. Geom..

[8]  Walter Whiteley,et al.  Plane Self Stresses and projected Polyhedra I: The Basic Pattem , 1993 .

[9]  Steven Fortune,et al.  Voronoi Diagrams and Delaunay Triangulations , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[10]  Marc Noy,et al.  Flipping Edges in Triangulations , 1996, SCG '96.

[11]  Charles L. Lawson,et al.  Properties of n-dimensional triangulations , 1986, Comput. Aided Geom. Des..

[12]  K. Sugihara.  Machine interpretation of line drawings , 1986, MIT Press series in artificial intelligence.

[13]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[14]  Carl W. Lee,et al.  Subdivisions and Triangulationsof Polytopes , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[15]  A. Brøndsted.  An Introduction to Convex Polytopes , 1982 .

[16]  Günter Rote,et al.  A pointed Delaunay pseudo-triangulation of a simple polygon , 2005, EuroCG.

[17]  Herbert Edelsbrunner,et al.  Incremental topological flipping works for regular triangulations , 1992, SCG '92.

[18]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[19]  Franz Aurenhammer,et al.  Pseudotriangulations from Surfaces and a Novel Type of Edge Flip , 2003, SIAM J. Comput..

[20]  G. C. Shephard,et al.  Convex Polytopes , 1967 .

[21]  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.

[22]  David Eppstein,et al.  MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .

[23]  D. T. Lee,et al.  Generalized delaunay triangulation for planar graphs , 1986, Discret. Comput. Geom..

[24]  Franz Aurenhammer,et al.  Pseudo-Simplicial Complexes from Maximal Locally Convex Functions , 2006, Discret. Comput. Geom..