Algorithms for triangulating polyhedra into a small number of tetrahedra (Q3424580)
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 5130555
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for triangulating polyhedra into a small number of tetrahedra |
scientific article; zbMATH DE number 5130555 |
Statements
2 March 2007
0 references
minimal triangulation of polyhedra
0 references
greedy peeling algorithm
0 references
cone triangulation
0 references
0.8485734462738037
0 references
0.8323224782943726
0 references
0.8227160573005676
0 references