Global rigidity of 2-dimensional direction-length frameworks
Abstract: A 2-dimensional direction-length framework is a collection of points in the plane which are linked by pairwise constraints that fix the direction or length of the line segments joining certain pairs of points. We represent it as a pair $(G,p)$, where $G=(V;D,L)$ is a mixed' graph and $p:V\to{\mathbb R}^2$ is a point configuration for $V$. It is globally rigid if every direction-length framework $(G,q)$ which satisfies the same constraints can be obtained from $(G,p)$ by a translation or a rotation by $180^\circ$. We show that the problem of characterising when a generic framework $(G,p)$ is globally rigid can be reduced to the case when $G$ belongs to a special family ofdirection irreducible' mixed graphs, and prove that {every} generic realisation of a direction irreducible mixed graph $G$ is globally rigid if and only if $G$ is 2-connected, direction-balanced and redundantly rigid.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.