Pseudo-Triangulations -- a Survey

Pseudo-Triangulations -- a Survey

Cached

Download Links

by Günter Rote , Francisco Santos , Ileana Streinu

Venue:	CONTEMPORARY MATHEMATICS
Citations:	7 - 3 self

BibTeX

@MISC{Rote_pseudo-triangulations--,
    author = {Günter Rote and Francisco Santos and Ileana Streinu},
    title = { Pseudo-Triangulations -- a Survey},
    year = {}
}

Bookmark

OpenURL

Abstract

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

Citations

314	How to draw a graph - Tutte - 1962
160	On graphs and rigidity of plane skeletal structures - Laman - 1970
128	Incremental topological flipping works for regular triangulations - Edelsbrunner, Shah - 1992
121	Reverse search for enumeration - Avis, Fukuda - 1996
102	Lectures on Polytopes. Volume 152 of Graduate Texts - Ziegler - 1995
94	The visibility complex - Pocchiola, Vegter - 1996
88	Ray shooting in polygons using geodesic triangulations - Chazelle, Edelsbrunner, et al. - 1994
80	Constructions and complexity of secondary polytopes - Billera, Filliman, et al. - 1990
78	Topologically sweeping visibility complexes via pseudo-triangulations - POCCHIOLA, VEGTER - 1996
76	Convex representation of graphs - Tutte - 1960
75	Deformable free space tiling for kinetic collision detection - Agarwal, Basch, et al. - 2001
73	Straightening polygonal arcs and convexifying polygonal cycles - Connelly, Demaine, et al. - 2000
64	Some matroids from discrete applied geometry, in Matroid theory - Whiteley - 1995
63	Kinetic collision detection for simple polygons - Kirkpatrick, Snoeyink, et al. - 2000
53	The rigidity of graphs - ASIMOW, ROTH - 1979
53	The associahedron and triangulations of the n-gon - Lee - 1989
39	Die Graphische Statik der starren Systeme. Johnson Reprint - Henneberg - 1911
39	Expansive motions and the polytope of pointed pseudo-triangulations - Rote, Streinu, et al. - 2003
38	Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations - Goodrich, Tamassia - 1997
32	Rigidity and scene analysis - Whiteley - 2004
31	Tight degree bounds for pseudo-triangulations of points - Kettner, Kirkpatrick, et al. - 2001
29	Realization Spaces of Polytopes - Richter-Gebert - 1996
28	Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons - Kirkpatrick, Speckmann
28	Minimal tangent visibility graph - POCCHIOLA, VEGTER - 1995
26	Planar minimally rigid graphs and pseudo-triangulations - Haas, Orden, et al. - 2005
25	Convex polytopes, volume 221 of Graduate Texts in Mathematics - Grünbaum - 2003
25	Pseudo-triangulations: Theory and applications - Pocchiola, Vegter - 1996
22	On reciprocal figures and diagrams of forces - Maxwell
20	Counting triangulations and pseudo-triangulations of wheels - Randall, Rote, et al. - 2001
19	Pseudo-triangulations from surfaces and a novel type of flip - Aichholzer, Aurenhammer, et al. - 2003
16	The zigzag path of a pseudotriangulation - Aichholzer, Rote, et al. - 2003
15	rigidity and motion planning - Pseudo-triangulations - 2005
14	Allocating vertex π-guards in simple polygons via pseudotriangulations - Speckmann, Tóth
13	Convexity minimizes pseudo-triangulations - Aichholzer, Aurenhammer, et al. - 2004
13	A lower bound on the number of triangulations of planar point sets - Aichholzer, Hurtado, et al.
13	Matroid Theory and Its Applications - Recski - 1989
12	Kinetic collision detection for two simple polygons - Basch, Erickson, et al.
11	Adapting (pseudo)-triangulations with a near-linear number of edge flips - Aichholzer, Aurenhammer, et al. - 2003
11	The polytope of non-crossing graphs on a planar point set - Orden, Santos - 2005
9	On constrained minimum pseudo-triangulations - Rote, Wang, et al. - 2003
9	Combinatorial roadmaps in configuration spaces of simple planar polygons - Streinu - 2001
8	A sum of squares theorem for visibility complexes and applications - Angelier, Pocchiola - 2003
8	Cgal-based implementation of visibility complexes - Angelier, Pocchiola - 2003
8	Kinetic Data Structures for Collision Detection - Speckmann - 2001
7	On the number of pseudo-triangulations of certain point sets - Aichholzer, Orden, et al.
7	Tutte’s barycenter method applied to isotopies - Verdière, Pocchiola, et al.
7	Single-vertex origami and spherical expansive motions - Streinu, Whiteley - 2004
6	Degree bounds for constrained pseudo-triangulations - Aichholzer, Hoffmann, et al. - 2003
6	Enumerating pseudo-triangulations in the plane - Bereg
6	New lower bounds for the number of straight-edge triangulations of a planar point set - McCabe, Seidel - 2004