Computer Science – Data Structures and Algorithms
Scientific paper
2011-05-16
Computer Science
Data Structures and Algorithms
Scientific paper
We study the fundamental algorithmic rigidity problems for generic frameworks periodic with respect to a fixed lattice or a finite-order rotation in the plane. For fixed-lattice frameworks we give an $O(n^2)$ algorithm for deciding generic rigidity and an O(n^3) algorithm for computing rigid components. If the order of rotation is part of the input, we give an O(n^4) algorithm for deciding rigidity; in the case where the rotation's order is 3, a more specialized algorithm solves all the fundamental algorithmic rigidity problems in O(n^2) time.
Berardi Matthew
Heeringa Brent
Malestein Justin
Theran Louis
No associations
LandOfFree
Rigid components in fixed-lattice and cone frameworks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Rigid components in fixed-lattice and cone frameworks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rigid components in fixed-lattice and cone frameworks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-727551