A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points (Q5114888)
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 Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points |
scientific article; zbMATH DE number 7215528
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points |
scientific article; zbMATH DE number 7215528 |
Statements
A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points (English)
0 references
29 June 2020
0 references
weighted Delaunay triangulations
0 references
non-regular triangulations
0 references
Lawson's flip algorithm
0 references
directed flips
0 references
monotone sequence
0 references
flip graph
0 references
redundant interior vertices
0 references
Schönhardt polyhedron
0 references
indecomposable polyhedra
0 references
Steiner points
0 references
0.8862173
0 references
0.8771075
0 references
0 references
0.87416965
0 references
0 references
0 references
0.8637444
0 references
0.8627359
0 references
0.8614461
0 references
