Erratum: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon (Q3809268): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0217067 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2018714551 / rank | |||
Normal rank | |||
Latest revision as of 22:42, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Erratum: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon |
scientific article |
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
