Generating triangulations of 2-manifolds (Q4035762)
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 176586
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generating triangulations of 2-manifolds |
scientific article; zbMATH DE number 176586 |
Statements
18 May 1993
0 references
incidence graph
0 references
reduction algorithm
0 references
efficient algorithm
0 references
shrinking
0 references
minimal triangulation
0 references
0.8477003574371338
0 references
0.8421139121055603
0 references
0.8129531741142273
0 references
0.7864373922348022
0 references
0.7764079570770264
0 references
Generating triangulations of 2-manifolds (English)
0 references
[For the entire collection see Zbl 0753.00016.] A triangulation of a 2-manifold \(M\) without boundary is called minimal if every edge is non-shrinkable. Any given triangulation can be obtained from a minimal one by vertex splitting, the inverse operation of edge- shrinking. The author presents an efficient algorithm for shrinking a given triangulation until finally a minimal triangulation is obtained.
0 references
