Planar Minimally Rigid Graphs and Pseudo-Triangulations

Planar Minimally Rigid Graphs and Pseudo-Triangulations (2003)

Cached

Download Links

by Ruth Haas , David Orden , Günter Rote , Francisco Santos , Brigitte Servatius , Hermann Servatius , Diane Souvaine , Ileana Streinu , Walter Whiteley

Citations:

26 - 14 self

BibTeX

@MISC{Haas03planarminimally,
    author = {Ruth Haas and David Orden and Günter Rote and Francisco Santos and Brigitte Servatius and Hermann Servatius and Diane Souvaine and Ileana Streinu and Walter Whiteley},
    title = {Planar Minimally Rigid Graphs and Pseudo-Triangulations },
    year = {2003}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (incident to an angle larger than π). In this paper we prove that the opposite statement is also true, namely that planar minimally rigid graphs always admit pointed embeddings, even under certain natural topological and combinatorial constraints. The proofs yield efficient embedding algorithms. They also provide—to the best of our knowledge—the first algorithmically effective result on graph embeddings with oriented matroid constraints other than convexity of faces.

Citations

557	Data structures and network algorithms - Tarjan - 1983
422	Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams - Guibas, Stolfi - 1985
314	How to draw a graph - Tutte - 1962
193	Efficient planarity testing - Hopcroft, Tarjan - 1974
168	Embedding planar graphs on the grid - Schnyder - 1990
160	On graphs and rigidity of plane skeletal structures - Laman - 1970
150	Generalized nested dissection - LIPTON, ROSE, et al. - 1979
141	Applications of a planar separator theorem - Lipton, Tarjan - 1980
115	On straight line representation of planar graphs - Fary - 1948
99	A combinatorial approach to planar non-colliding robot arm motion planning - Streinu - 2000
93	2-isomorphic graphs - Whitney - 1933
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
56	How to draw a planar graph on a grid, Combinatorica 10 - Frajsseix, Pach, et al. - 1990
39	Graph Theory,” Second Edition - Diestel - 2000
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
36	Protein flexibility prediction using graph theory - Jacobs, Rader, et al. - 2001
35	Tutte, Connectivity in Graphs - T - 1966
32	Rigidity and scene analysis - Whiteley - 2004
31	Convex drawings of planar graphs and the order dimension of 3-polytopes - Felsner
31	Tight degree bounds for pseudo-triangulations of points - Kettner, Kirkpatrick, et al. - 2001
29	Realization Spaces of Polytopes - Richter-Gebert - 1996
28	Convex drawings of graphs in two and three dimensions - Chrobak, Goodrich, et al. - 1996
27	A proof of Connelly’s conjecture on 3-connected generic cycles - Berg, Jordan - 2002
27	How to morph tilings injectively - Floater, Gotsman - 1999
25	Pseudo-triangulations: Theory and applications - Pocchiola, Vegter - 1996
23	A theory of 3-connected graphs - Tutte - 1961
22	Tutte, Convex Representations of Graphs - T - 1960
20	Counting triangulations and pseudo-triangulations of wheels - Randall, Rote, et al. - 2001
17	Plane self stresses and projected polyhedra I: The basic pattern - Crapo, Whiteley - 1993
16	The zigzag path of a pseudotriangulation - Aichholzer, Rote, et al. - 2003
15	Counting and enumerating pseudotriangulations with the greedy flip algorithm - Brönnimann, Kettner, et al. - 2001
15	Spaces of stresses, projections, and parallel drawings for spherical polyhedra. Beitraege zur Algebra und Geometrie / Contributions to Algebra and Geometry - Crapo, Whiteley - 1994
15	Sensor network topologies of formations with distance - direction - angle constraints - Eren, Whiteley, et al. - 2003
15	Varieties of combinatorial types of projective configurations and convex polyhedra - Mnëv - 1985
14	Allocating vertex π-guards in simple polygons via pseudotriangulations - Speckmann, Tóth
13	Convexity minimizes pseudo-triangulations - Aichholzer, Aurenhammer, et al. - 2004
12	Rigidity of Molecular Structures: Generic and Geometric Analysis - Whiteley - 1999
11	The polytope of non-crossing graphs on a planar point set - Orden, Santos - 2005
11	On combinatorial structures of line drawings of polyhedra - Imai - 1985
10	Data Structures and Network Algorithms CBMS-NSF - Tarjan - 1983
9	Combinatorial roadmaps in configuration spaces of simple planar polygons - Streinu - 2001
8	Vertex-Edge Pseudo-Visibility Graphs: Characterization and Recognition - O’Rourke, Streinu - 1997
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	H.Servatius. The structure of locally finite two-connected graphs - Droms, Servatius - 1995