A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs

DOI10.1016/j.jsc.2016.02.006zbMath1356.68160OpenAlexW2303885384MaRDI QIDQ507133

Robert Joan-Arinyo, Marta R. Hidalgo

Publication date: 3 February 2017

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/102162

zbMATH Keywords

tree-decompositiongeometric constraint solvinggeometric constraint graphsHenneberg sequencesLaman graphsminimally rigid graphs

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Specified-time bearing-based formation control of multi-agent systems via a dynamic gain approach

Cites Work

• Rigidity, global rigidity, and graph decomposition
• Planar minimally rigid graphs and pseudo-triangulations
• The number of embeddings of minimally rigid graphs
• The non-solvability by radicals of generic 3-connected planar Laman graphs
• DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY
• Decomposition plans for geometric constraint systems. I: Performance measures for CAD
• Decomposition plans for geometric constraint problems. II: New algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item