Abstract
A bar framework G(p) in r-dimensional Euclidean space is a graph G on the vertices 1, 2, . . . , n, where each vertex i is located at point p i in \({\mathbb{R}^r}\) . Given a framework G(p) in \({\mathbb{R}^r}\) , a problem of great interest is that of determining whether or not there exists another framework G(q), not obtained from G(p) by a rigid motion, such that ||q i − q j||2 = ||p i − p j ||2 for each edge (i, j) of G. This problem is known as either the global rigidity problem or the universal rigidity problem depending on whether such a framework G(q) is restricted to be in the same r-dimensional space or not. The stress matrix S of a bar framework G(p) plays a key role in these and other related problems. In this paper, semidefinite programming (SDP) theory is used to address, in a unified manner, several problems concerning universal rigidity. New results are presented as well as new proofs of previously known theorems. In particular, we use the notion of SDP non-degeneracy to obtain a sufficient condition for universal rigidity, and we show that this condition yields the previously known sufficient condition for generic universal rigidity. We present new results concerning positive semidefinite stress matrices and we use a semidefinite version of Farkas lemma to characterize bar frameworks that admit a nonzero positive semidefinite stress matrix S.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Alfakih A.Y.: Graph rigidity via Euclidean distance matrices. Linear Algebra Appl. 310, 149–165 (2000)
Alfakih, A.Y.: On the set of realizations of edge-weighted graphs in Euclidean spaces. Research Report, Mathematics and Statistics, U of Windsor (2005)
Alfakih A.Y.: On dimensional rigidity of bar-and-joint frameworks. Discret. Appl. Math. 155, 1244–1253 (2007)
Alfakih A.Y.: On the universal rigidity of generic bar frameworks. Contrib. Discret. Math. 5, 7–17 (2010)
Alfakih A.Y., Khandani A., Wolkowicz H.: Solving Euclidean distance matrix completion problems via semidefinite programming. Comput. Optim. Appl. 12, 13–30 (1999)
Alizadeh F., Haeberly J.A., Overton M.L.: Complementarity and nondegeneracy in semidefinite programming. Math. Program. Ser. B 77, 111–128 (1997)
Biswas, P., Ye, Y.: Semidefinite programming for ad hoc wireless sensor network localization. Technical report, Department of Management Science and Engineering, Stanford University (2003)
Connelly R.: Generic global rigidity. Discret. Comput. Geom. 33, 549–563 (2005)
Connelly R.: Tensegrity structures: why are they stable?. In: Thorpe, M.F., Duxbury, P.M. (eds) Rigidity Theory and Applications, pp. 47–54. Kluwer academic/Plenum Publishers, Dordrecht (1999)
Cox T.F., Cox M.A.: Multidimensional Scaling. Chapman and Hall, London (2001)
Crippen G.M., Havel T.F.: Distance Geometry and Molecular Conformation. Wiley, New York (1988)
Ding, Y., Krislock, N., Qian, J., Wolkowicz, H.: Sensor network localization, Euclidean distance matrix completions, and graph realization. CORR 2006–23, Department of Combinatorics and Optimization, U. of Waterloo (2006)
Eren, T., Goldenberg, D.K., Whiteley, W., Yang, Y.R., Morse, A.S., Anderson, B.D.O., Belhumeur, P.N.: Rigidity, computation, and randomization in network localization. IEEE INFOCOM (2004)
Gale, D.: Neighboring vertices on a convex polyhedron. In: Linear Inequalities and Related System, pp. 255–263. Princeton University Press (1956)
Gortler, S.J., Healy, A.D., Thurston, D.P.: Characterizing generic global rigidity, 2007. arXiv/0710.0926v4
Gortler, S.J., Thurston, D.P.: Characterizing the universal rigidity of generic frameworks, 2009. arXiv/1001.0172v1
De Leeuw, J., Heiser, W.: Theory of multidimensional scaling. In: Krishnaiah, P.R., Kanal, L.N. (eds.) Handbook of Statistics, vol. 2, pp. 285–316. North-Holland (1982)
Moreau J.J.: Décomposition orthogonale d’un espace hilbertien selon deux cônes mutuellement polaires. C. R. Acad. Sci Paris 255, 238–240 (1962)
Pong, T.K., Tseng, P.: Robust edge-based semidefinite programming relaxation of sensor network localization. Technical report, U. of Washington (2009)
Rockafellar R.T.: Convex Analysis. Princeton University Press, New Jersey (1970)
Saxe, J.B.: Embeddability of weighted graphs in k-space is strongly NP-hard. In: Proceedings of 17th Allerton Conference in Communications, Control, and Computing, pp. 480–489 (1979)
So, A.M.-C., Ye, Y.: A semidefinite programming approach to tensegrity theory and realizability of graphs. In: Proceedings of 17th annual ACM-SIAM symposium on discrete algorithms, pp. 766–775 (2006)
So A.M.-C., Ye Y.: Theory of semidefinite programming for sensor network localization. Math. Program. Ser. B 109, 367–384 (2007)
Wang Z., Zheng S., Ye Y., Boyd S.: Further relaxations of the semidefinite programming approach to sensor network localization. SIAM J. Optim 19, 655–673 (2008)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported by the Natural Sciences and Engineering Research Council of Canada.
Rights and permissions
About this article
Cite this article
Alfakih, A.Y. On bar frameworks, stress matrices and semidefinite programming. Math. Program. 129, 113–128 (2011). https://doi.org/10.1007/s10107-010-0389-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-010-0389-z