Finding and Maintaining Rigid Components

Authors

Audrey Lee, University of Massachusetts Amherst
Ileana Streinu, Smith CollegeFollow
Louis Theran, University of Massachusetts Amherst

Document Type

Conference Proceeding

Publication Date

1-1-2005

Publication Title

Proceedings of the 17th Canadian Conference on Computational Geometry, CCCG 2005

Abstract

We give the first complete analysis that the complexity of finding and maintaining rigid components of planar bar-and-joint frameworks and arbitrary d-dimensional body-and-bar frameworks, using a family of algorithms called pebble games, is O(n2). To this end, we intro- duce a new data structure problem called union pair- find, which maintains disjoint edge sets and supports pair-find queries of whether two vertices are spanned by a set. We present solutions that apply to generalizations of the pebble game algorithms, beyond the original rigidity motivation.

First Page

219

Last Page

222

Comments

Archived as published.

Recommended Citation

Lee, Audrey; Streinu, Ileana; and Theran, Louis, "Finding and Maintaining Rigid Components" (2005). Computer Science: Faculty Publications, Smith College, Northampton, MA.
https://scholarworks.smith.edu/csc_facpubs/245