Erratum: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon (Q3809268)
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: Erratum: An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon |
scientific article; zbMATH DE number 4078807
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Erratum: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon |
scientific article; zbMATH DE number 4078807 |
Statements
Erratum: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon (English)
0 references
1988
0 references
amortized
0 references
balanced divide and conquer
0 references
heterogeneous finger search tree
0 references
homogeneous finger search tree
0 references
horizontal visibility information
0 references
Jordan sorting with error-correction
0 references
simplicity testing
0 references
triangulation problem
0 references
computational geometry
0 references
