Characterizing the universal rigidity of generic frameworks

DOI10.1007/s00454-014-9590-9zbMath1298.05303arXiv1001.0172OpenAlexW2093340362MaRDI QIDQ741616

Steven J. Gortler, Dylan P. Thurston

Publication date: 12 September 2014

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1001.0172

zbMATH Keywords

semidefinite programmingstrict complementaritygraph rigidity

Mathematics Subject Classification ID

Semidefinite programming (90C22) Graph algorithms (graph-theoretic aspects) (05C85) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Related Items

Equivalence of continuous, local and infinitesimal rigidity in normed spaces, Generically globally rigid graphs have generic universally rigid frameworks, Constructing uniquely realizable graphs, On affine motions and bar frameworks in general position, On stress matrices of \((d + 1)\)-lateration frameworks in general position, Characterizing the universal rigidity of generic tensegrities, Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming, On affine motions and universal rigidity of tensegrity frameworks, Positive semidefinite matrix completion, universal rigidity and the strong Arnold property, Graph connectivity and universal rigidity of bar frameworks, Universal rigidity of complete bipartite graphs, Universal rigidity of bar frameworks via the geometry of spectrahedra, Singularity Degree of the Positive Semidefinite Matrix Completion Problem, On bar frameworks, stress matrices and semidefinite programming, Combining globally rigid frameworks, Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP, Global Registration of Multiple Point Clouds Using Semidefinite Programming, Local, Dimensional and Universal Rigidities: A Unified Gram Matrix Approach, Iterative universal rigidity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence behavior of interior-point algorithms
• The Kneser-Poulsen conjecture for spherical polytopes
• On bar frameworks, stress matrices and semidefinite programming
• The algebraic degree of semidefinite programming
• Theory of semidefinite programming for sensor network localization
• Operations preserving the global rigidity of graphs and frameworks in the plane
• Properties of Euclidean and non-Euclidean distance matrices
• Rigidity and energy
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding
• Complementarity and nondegeneracy in semidefinite programming
• An exact duality theory for semidefinite programming and its complexity implications
• The geometry of graphs and some of its algorithmic applications
• On dimensional rigidity of bar-and-joint frameworks
• A k-extreme point is the limit of k-exposed points
• Generic global rigidity
• Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
• Characterizing generic global rigidity
• Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
• Convex Polytopes
• Linear Programming
• Über exponierte Punkte abgeschlossener Punktmengen
• Semidefinite Programming
• Convex Analysis
• On the generic properties of convex optimization problems in conic form