Planar minimally rigid graphs and pseudo-triangulations

Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent 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 the first algorithmically effective result on graph embeddings with oriented matroid constraints other than convexity of faces. These constraints are described by combinatorial pseudo-triangulations, first defined and studied in this paper. Also of interest are our two proof techniques, one based on Henneberg inductive constructions from combinatorial rigidity theory, the other on a generalization of Tutte’s barycentric embeddings to directed graphs. Key words: Pseudotriangulations, rigidity, graph drawing. Preprint submitted to Elsevier Science 28 May 2004 

• Type: Conference
• Year: 2003
• Where: COMPGEOM
• Authors: Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley
• Keywords: Combinatorial Constraints, COMPGEOM 2003, Pointed Embeddings, Rigid Graphs