A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs (Q507133): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:24, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs |
scientific article |
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
