The Slider-Pinning Problem

Authors

Audrey Lee
Ileana Streinu, Smith CollegeFollow
Louis Theran

Document Type

Conference Proceeding

Publication Date

12-1-2007

Publication Title

CCCG 2007 - 19th Canadian Conference on Computational Geometry

Abstract

A Laman mechanism is a flexible planar bar-and-joint framework with m ≤ 2n-3 edges and exactly k = 2n-m degrees of freedom. The slider-pinning problem is to eliminate all the degrees of freedom of a Laman mechanism, in an optimal fashion, by individually fixing x or y coordinates of vertices. We describe two easy to implement O(n2) time algorithms.

First Page

113

Last Page

116

Comments

Archived as published.

Recommended Citation

Lee, Audrey; Streinu, Ileana; and Theran, Louis, "The Slider-Pinning Problem" (2007). Computer Science: Faculty Publications, Smith College, Northampton, MA.
https://scholarworks.smith.edu/csc_facpubs/268