Characterizing graphs with convex and connected Cayley configuration spaces

DOI10.1007/s00454-009-9160-8zbMath1215.05085OpenAlexW2064178031MaRDI QIDQ2380778

Heping Gao, Sitharam, Meera

Publication date: 12 April 2010

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

Full work available at URL: https://doi.org/10.1007/s00454-009-9160-8

zbMATH Keywords

distance geometrygraph minorconvexalgebraic complexityframeworkmechanismcombinatorial rigiditylinkagegraph characterizationCayley configuration spacesemidefinite and linear programmingunderconstrained geometric constraint system

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (7)

Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials ⋮ Volume Frameworks and Deformation Varieties ⋮ On Flattenability of Graphs ⋮ Computing Circuit Polynomials in the Algebraic Rigidity Matroid ⋮ The Excluded Minors for Isometric Realizability in the Plane ⋮ On the area of constrained polygonal linkages ⋮ Algebraic Matroids in Action

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Realizability of graphs
• Realizability of graphs in three dimensions
• Solving Euclidean distance matrix completion problems via semidefinite progrmming
• An algorithm for two-dimensional rigidity percolation: The pebble game
• Connected rigidity matroids and unique realizations of graphs
• Generic global rigidity
• Globally linked pairs of vertices in equivalent realizations of graphs
• On graphs and rigidity of plane skeletal structures
• The non-solvability by radicals of generic 3-connected planar Laman graphs
• WELL-CONSTRAINED COMPLETION AND DECOMPOSITION FOR UNDER-CONSTRAINED GEOMETRIC CONSTRAINT PROBLEMS
• A semidefinite programming approach to tensegrity theory and realizability of graphs
• Characterizing generic global rigidity
• Conditions for Unique Graph Realizations
• Metric Spaces and Positive Definite Functions
• Decomposition plans for geometric constraint systems. I: Performance measures for CAD
• Decomposition plans for geometric constraint problems. II: New algorithms

This page was built for publication: Characterizing graphs with convex and connected Cayley configuration spaces