Pseudo-Triangulations - a Survey

作者: Francisco Santos , Ileana Streinu , Guenter Rote

DOI:

关键词:

摘要: A pseudo-triangle is a simple polygon with three convex vertices, and pseudo-triangulation face-to-face tiling of planar region into pseudo-triangles. Pseudo-triangulations appear as data structures in computational geometry, bar-and-joint frameworks rigidity theory projections locally surfaces. This survey current literature includes combinatorial properties counting special classes, theoretical results, representations polytopes, straight-line drawings from abstract versions called pseudo-triangulations, algorithms applications pseudo-triangulations.

参考文章(59)
Jack Snoeyink, Ileana Streinu, Computing Rigid Components of Pseudo-triangulation Mechanisms in Linear Time. canadian conference on computational geometry. pp. 223- 226 ,(2005)
Ileana Streinu, Combinatorial Roadmaps in Configuration Spaces of Simple Planar Polygons. Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science. pp. 181- 205 ,(2001)
R. E. Burkard, U. Faigle, Matroid theory and its applications Zeitschrift für Operations Research. ,vol. 35, pp. 348- 349 ,(1991) , 10.1007/BF01417522
Boris Aronov, Eli Goodman, Ricky Pollack, Discrete and computational geometry : the Goodman-Pollack Festschrift Springer. ,(2003)
Walter Whiteley, Rigidity and scene analysis Handbook of Discrete and Computational Geometry, Second Edition. pp. 893- 916 ,(2004) , 10.1201/9781420035315.CH60
Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips Lecture Notes in Computer Science. pp. 12- 24 ,(2003) , 10.1007/978-3-540-45078-8_2
Jürgen Richter-Gebert, Realization Spaces of Polytopes ,(1996)
Pierre Angelier, Michel Pocchiola, A Sum of Squares Theorem for Visibility Complexes and Applications Algorithms and Combinatorics. pp. 77- 137 ,(2003) , 10.1007/978-3-642-55566-4_5