Computing Rigid Components of Pseudo-Triangulation Mechanisms in Linear Time

Authors

Jack Snoeyink, The University of North Carolina at Chapel Hill
Ileana Streinu, Smith CollegeFollow

Document Type

Conference Proceeding

Publication Date

1-1-2005

Publication Title

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

Abstract

We investigate the problem of detecting rigid components (maximal Laman subgraphs) in a pseudotriangulation mechanism and in arbitrary pointed planar frameworks.F or general Laman graphs with some missing edges, it is known that rigid components can be computed in O(n2) time.Here we make substantial use of the special geometry of pointed pseudo-triangulation mechanisms to achieve linear time. The main application is a more robust implementation and a substantial reduction in numerical computations for the solution to the Carpenter's Rule problem given by the second author.

First Page

223

Last Page

226

Comments

Archived as published.

Recommended Citation

Snoeyink, Jack and Streinu, Ileana, "Computing Rigid Components of Pseudo-Triangulation Mechanisms in Linear Time" (2005). Computer Science: Faculty Publications, Smith College, Northampton, MA.
https://scholarworks.smith.edu/csc_facpubs/290