A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs (Q507133)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs |
scientific article; zbMATH DE number 6680369
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs |
scientific article; zbMATH DE number 6680369 |
Statements
A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs (English)
0 references
3 February 2017
0 references
minimally rigid graphs
0 references
Laman graphs
0 references
Henneberg sequences
0 references
geometric constraint solving
0 references
geometric constraint graphs
0 references
tree-decomposition
0 references
