An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon (Q3777450): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: DBLP publication ID (P1635): journals/siamcomp/TarjanW88, #quickstatements; #temporary_batch_1731505720702 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/siamcomp/TarjanW88 / rank | |||
Normal rank | |||
Latest revision as of 15:25, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon |
scientific article |
Statements
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
