An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation (Q4009010)
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 63449
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation |
scientific article; zbMATH DE number 63449 |
Statements
An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation (English)
0 references
27 September 1992
0 references
computational geometry
0 references
edge insertion
0 references
constrained triangulation
0 references
polygon triangulation
0 references
minimum weight triangulation
0 references
Delaunay triangulation
0 references
minmax angle triangulation
0 references
finite element
0 references
surface approximation
0 references
iterative improvement method
0 references
edge-insertion scheme
0 references
0.8758693933486938
0 references
0.8709599375724792
0 references
0.861589252948761
0 references
0.8558222651481628
0 references
0.8530711531639099
0 references
