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 the normal view instead:
scientific article; zbMATH DE number 6680369
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7755945920944214
0 references
0.7678060531616211
0 references
0.7431427240371704
0 references
0.7068410515785217
0 references
0.7030702233314514
0 references
