Document Type
Conference Proceeding
Publication Date
12-12-2008
Publication Title
Proceedings of the Annual Symposium on Computational Geometry
Abstract
How many pair-wise distances must be prescribed between an unknown set of points, and how should they be distributed, to determine only a discrete set of possible solutions? These questions, and related generalizations, are central in a variety of applications. Combinatorial rigidity shows that in two-dimensions one can get the answer, generically, via an efficiently testable sparse graph property. We present a video and a web site illustrating algorithmic results for a variety of rigidity-related problems, as well as abstract generalizations. Our accompanying interactive software is based on a comprehensive implementation of the pebble game paradigm.
Keywords
Computational geometry, Pebble games, Rigidity, Sparse graphs
First Page
226
Last Page
227
DOI
10.1145/1377676.1377715
Rights
© 2008 the authors
Recommended Citation
Lee, Audrey; Streinu, Ileana; and Theran, Louis, "Analyzing Rigidity with Pebble Games" (2008). Computer Science: Faculty Publications, Smith College, Northampton, MA.
https://scholarworks.smith.edu/csc_facpubs/228
Comments
Archived as published.