Abstract
Let (G, P) be a bar framework of n vertices in general position in \({\mathbb{R}^d}\) , for d ≤ n − 1, where G is a (d + 1)-lateration graph. In this paper, we present a constructive proof that (G, P) admits a positive semidefinite stress matrix with rank (n − d − 1). We also prove a similar result for a sensor network, where the graph consists of m(≥ d + 1) anchors.
References
Alfakih, A.Y.: On bar frameworks, stress matrices and semidefinite programming. Mathematical Programming, Series B (to appear 2011)
Alfakih A.Y.: Graph rigidity via Euclidean distance matrices. Linear Algebra Appl. 310, 149–165 (2000)
Alfakih A.Y.: On rigidity and realizability of weighted graphs. Linear Algebra Appl. 325, 57–70 (2001)
Alfakih A.Y.: On the universal rigidity of generic bar frameworks. Contrib. Discret. Math. 5(3), 7–17 (2010)
Alfakih A.Y., Khandani A., Wolkowicz H.: Solving Euclidean distance matrix completion problems via semidefinite programming. Comput. Opt. Appl. 12, 13–30 (1999)
Alfakih, A.Y., Ye, Y.: On affine motions of bar frameworks in general position. arXiv/1009.3318 (2010)
Alfakih, A.Y., Taheri, N., Ye, Y.: Toward the universal rigidity of general frameworks. arXiv/1009.1185 (2010)
Aspnes, J., Goldenberg, D., Richard Yang, Y.: On the Computational Complexity of Sensor Network Localization. ALGOSENSORS 2004. In: LNCS, vol. 3121, pp. 32–44 (2004)
Biswas, P., Ye, Y.: Semidefinite programming for ad hoc wireless sensor network localization. In: Proc. 3rd IPSN, pp. 46–54 (2004)
Biswas P., Toh K.C., Ye Y.: A distributed SDP approach for large-scale noisy anchor-free graph realization with applications to molecular conformation. SIAM J. Sci. Comput. 30(3), 1251–1277 (2008)
Eren, T., Goldenberg, D.K., Whiteley, W., Yang, Y.R., Moore, A.S., Anderson, B.D.O., Belhumeur, P.N.: Rigidity, computation, and randomization in network localization. In: Proc. 23rd INFOCOM (2004)
Connelly R.: Second-order rigidity and pre-stress stability for tensegrity frameworks. SIAM J. Discret. Math 9(1), 453–491 (1996)
Connelly R.: Tensegrity structures: why are they stable?. In: Thorpe, M.F., Duxbury, P.M. (eds) Rigidity Theory and Applications., pp. 47–54. Kluwer/Plenum, New York (1999)
Connelly R.: Generic global rigidity. Discret. Comput Geom. 33(4), 549–563 (2005)
Gortler, S.J., Thurston, D.P.: Characterizing the universal rigidity of generic frame-works. arXiv/1001.0172v1 (2009)
Gortler S.J., Healy A.D., Thurston D.P.: Characterizing generic global rigidity. Am. J. Math. 132(4), 897–939 (2010)
Graver J., Servatius B., Servatius H.: Combinatorial Rigidity. Graduate studies in mathematics, vol 2. American Mathematical Society, Providence (1993)
Hendrickson B.: Conditions for unique graph realizations. SIAM J. Comput. 21(1), 65–84 (1992)
Jackson, B., Jordán, T.: Connected rigidity matroids and unique realizations of graphs. Preprint (2003)
So, A.M.-C.: A Semidefinite Programming Approach to the Graph Realization Problem: Theory, Applications and Extensions. Ph.D. Thesis, Stanford University (2007)
So, A.M.-C., Ye, Y.: Theory of semidefinite programming for sensor network localization. In: Proceedings of the 17th Annual ACM—SIAM Symposium on Discrete Algorithm (SODA 2005) 2005, pp. 405–414; and Mathematical Programming, Series B, vol. 109, no. 2, pp. 367–384 (2007)
So, A.M.-C., Ye, Y.: A semidefinite programming approach to tensegrity theory and realizability of graphs. In: Proceedings of the 18th Annual ACM—SIAM Symposium on Discrete Algorithm (SODA 2006), pp. 766–775 (2006)
Zhu, Z., So, A.M.-C., Ye, Y.: Universal rigidity: towards accurate and efficient localization of wireless networks. In: Proc. IEEE INFOCOM (2010)
Author information
Authors and Affiliations
Corresponding author
Additional information
Alfakih’s research is supported by the Natural Sciences and Engineering Research Council of Canada. Taheri’s research is supported in part by DOE Grant DE-SC0002009. Ye’s research supported in part by NSF Grant GOALI 0800151 and DOE Grant DE-SC0002009. This paper is a shortened version of [7].
Rights and permissions
About this article
Cite this article
Alfakih, A.Y., Taheri, N. & Ye, Y. On stress matrices of (d + 1)-lateration frameworks in general position. Math. Program. 137, 1–17 (2013). https://doi.org/10.1007/s10107-011-0480-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-011-0480-0