Abstract
Suppose a finite configuration of labeled points p = (p1,. . . ,pn) in E d is given along with certain pairs of those points determined by a graph G such that the coordinates of the points of p are generic, i.e., algebraically independent over the integers. If another corresponding configuration q = (q1,. . . ,qn) in E d is given such that the corresponding edges of G for p and q have the same length, we provide a sufficient condition to ensure that p and q are congruent in E d. This condition, together with recent results of Jackson and Jordán, give necessary and sufficient conditions for a graph being generically globally rigid in the plane. © 2004 Springer Science+Business Media, Inc.
Cite
CITATION STYLE
Connelly, R. (2005). Generic global rigidity. Discrete and Computational Geometry, 33(4), 549–563. https://doi.org/10.1007/s00454-004-1124-4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.