Characterizing the universal rigidity of generic frameworks
From MaRDI portal
(Redirected from Publication:741616)
Abstract: A framework is a graph and a map from its vertices to E^d (for some d). A framework is universally rigid if any framework in any dimension with the same graph and edge lengths is a Euclidean image of it. We show that a generic universally rigid framework has a positive semi-definite stress matrix of maximal rank. Connelly showed that the existence of such a positive semi-definite stress matrix is sufficient for universal rigidity, so this provides a characterization of universal rigidity for generic frameworks. We also extend our argument to give a new result on the genericity of strict complementarity in semidefinite programming.
Recommendations
Cites work
- A k-extreme point is the limit of k-exposed points
- An exact duality theory for semidefinite programming and its complexity implications
- Characterizing generic global rigidity
- Complementarity and nondegeneracy in semidefinite programming
- Convergence behavior of interior-point algorithms
- Convex Analysis
- Convex Polytopes
- Generic global rigidity
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 1534289 (Why is no real title available?)
- scientific article; zbMATH DE number 3108009 (Why is no real title available?)
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- Linear Programming
- On bar frameworks, stress matrices and semidefinite programming
- On dimensional rigidity of bar-and-joint frameworks
- On the generic properties of convex optimization problems in conic form
- On the universal rigidity of generic bar frameworks
- Operations preserving the global rigidity of graphs and frameworks in the plane
- Properties of Euclidean and non-Euclidean distance matrices
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Rigidity and energy
- Semidefinite Programming
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
- The algebraic degree of semidefinite programming
- The geometry of graphs and some of its algorithmic applications
- The Kneser-Poulsen conjecture for spherical polytopes
- Theory of semidefinite programming for sensor network localization
- Über exponierte Punkte abgeschlossener Punktmengen
Cited in
(27)- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- On affine motions and bar frameworks in general position
- On stress matrices of \((d + 1)\)-lateration frameworks in general position
- Generically globally rigid graphs have generic universally rigid frameworks
- Iterative universal rigidity
- On affine motions and universal rigidity of tensegrity frameworks
- Positive semidefinite matrix completion, universal rigidity and the strong Arnold property
- Equivalence of continuous, local and infinitesimal rigidity in normed spaces
- Characterizing the universal rigidity of generic tensegrities
- Constructing uniquely realizable graphs
- Dimensional and universal rigidities of bar frameworks
- On Farkas lemma and dimensional rigidity of bar frameworks
- <scp>Almost‐Rigidity</scp> of Frameworks
- Graph connectivity and universal rigidity of bar frameworks
- Universal rigidity of complete bipartite graphs
- Universal rigidity of bar frameworks via the geometry of spectrahedra
- 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
- Singularity degree of the positive semidefinite matrix completion problem
- Exponential convergence of time-of-arrival based network clock synchronization under practical assumptions
- Maximum likelihood thresholds via graph rigidity
- Super stable tensegrities and the Colin de Verdière number
- Equilibrium stresses in frameworks via symmetric averaging
- On bar frameworks, stress matrices and semidefinite programming
- Combining globally rigid frameworks
- Stress matrices and global rigidity of frameworks on surfaces
This page was built for publication: Characterizing the universal rigidity of generic frameworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741616)
