Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Rigid components in fixed-lattice and cone frameworks (1105.3234v1)

Published 16 May 2011 in cs.DS and math.CO

Abstract: 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(n2)$ algorithm for deciding generic rigidity and an O(n3) algorithm for computing rigid components. If the order of rotation is part of the input, we give an O(n4) 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(n2) time.

Citations (13)

Summary

We haven't generated a summary for this paper yet.