Planar minimally rigid graphs and pseudo-triangulations

DOI10.1145/777792.777817zbMath1377.68279OpenAlexW2127433635MaRDI QIDQ5361619

Walter J. Whiteley, Günter Rote, Diane L. Souvaine, David Orden, Brigitte Servatius, Ruth Haas, Francisco Santos, Ileana Streinu, Herman J. Servatius

Publication date: 29 September 2017

Published in: Proceedings of the nineteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/777792.777817

zbMATH Keywords

rigiditygraph drawingpseudo-triangulation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Connecting colored point sets ⋮ Convexity minimizes pseudo-triangulations ⋮ Kinetic collision detection between two simple polygons. ⋮ Planar minimally rigid graphs and pseudo-triangulations