Abstract
It is an intriguing open problem to give a combinatorial characterisation or polynomial algorithm for determining when a graph is globally rigid in ℝd. This means that any generic realisation is uniquely determined up to congruence when each edge represents a fixed length constraint. Hendrickson gave two natural necessary conditions, one involving connectivity and the other redundant rigidity. In general, these are not sufficient, but they do suffice in two dimensions, as shown by Jackson and Jordán. Our main result is an analogue of the redundant rigidity condition for frameworks that have both direction and length constraints. For any generic globally rigid direction-length framework in ℝd with at least 2 length edges, we show that deleting any length edge results in a rigid framework. It seems harder to obtain a corresponding result when a direction edge is deleted: we can do this in two dimensions, under an additional hypothesis that we believe to be unnecessary. Our proofs use a lemma of independent interest, stating that a certain space parameterising equivalent frameworks is a smooth manifold. We prove this lemma using arguments from differential topology and the Tarski–Seidenberg theorem on semi-algebraic sets.
Article PDF
Similar content being viewed by others
References
Connelly, R.: Generic global rigidity. Discrete Comput. Geom. 33, 549–563 (2005)
Gortler, S., Healy, A., Thurston, D.: Characterizing generic global rigidity (2007). arXiv:0710.0926
Hendrickson, B.: Conditions for unique graph realizations. SIAM J. Comput. 21, 65–84 (1992)
Jackson, B., Jordán, T.: Connected rigidity matroids and unique realizations of graphs. J. Comb. Theory, Ser. B 94, 1–29 (2005)
Jackson, B., Jordán, T.: Globally rigid circuits of the direction–length rigidity matroid. J. Comb. Theory, Ser. B 100, 1–23 (2010)
Jackson, B., Jordán, T.: Operations preserving global rigidity of generic direction–length frameworks. Int. J. Comput. Geom. Appl. 20, 685–708 (2010)
Jackson, B., Keevash, P.: Bounded direction–length frameworks. Discrete Comput. Geom. (2011). doi:10.1007/s00454-011-9325-0
Lee, J.M.: Introduction to Smooth Manifolds. Springer, Berlin (2003)
Milnor, J.W.: Topology from the Differentiable Viewpoint. University Press of Virginia, Charlottesville (1965)
Seidenberg, A.: A new decision method for elementary algebra. Ann. Math. 60, 365–374 (1954)
Servatius, B., Whiteley, W.: Constraining plane configurations in CAD: combinatorics of directions and lengths. SIAM J. Discrete Math. 12, 136–153 (1999)
Tarski, A.: A decision method for elementary algebra and geometry. Manuscript. Santa Monica, CA: RAND Corp. (1948). Republished as A Decision Method for Elementary Algebra and Geometry, 2nd edn. University of California Press, Berkeley, CA (1951)
Whiteley, W.: Some matroids from discrete applied geometry. In: Matroid Theory. AMS Contemporary Mathematics, vol. 197, pp. 171–313 (1996)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jackson, B., Keevash, P. Necessary Conditions for the Global Rigidity of Direction–Length Frameworks. Discrete Comput Geom 46, 72–85 (2011). https://doi.org/10.1007/s00454-011-9326-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-011-9326-z