Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 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

Global rigidity of 2-dimensional direction-length frameworks with connected rigidity matroids (1608.08559v1)

Published 30 Aug 2016 in math.CO

Abstract: A two-dimensional direction-length framework $(G,p)$ consists of a multigraph $G=(V;D,L)$ whose edge set is formed of "direction" edges $D$ and "length" edges $L$, and a realisation $p$ of this graph in the plane. The edges of the framework represent geometric constraints: length edges fix the distance between their endvertices, whereas direction edges specify the gradient of the line through both endvertices. A direction-length framework $(G,p)$ is globally rigid if every framework $(G,q)$ which satisfies the same direction and length constraints as $(G,p)$ can be obtained by translating $(G,p)$ in the plane, and/or rotating $(G,p)$ by $180{\circ}$. In this paper, we characterise global rigidity for generic direction-length frameworks whose associated rigidity matroid is connected, by showing that such frameworks are globally rigid if and only if every 2-separation of the underlying graph is direction-balanced.

Summary

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