An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation (Q4009010): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Herbert Edelsbrunner / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Roman Waupotitsch / rank | |||
Normal rank | |||
Revision as of 17:24, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation |
scientific article |
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
