Erratum: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
From MaRDI portal
Publication:3809268
DOI10.1137/0217067zbMath0659.68068MaRDI QIDQ3809268
Robert Endre Tarjan, Christopher J. Van Wyk
Publication date: 1988
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0217067
computational geometry; simplicity testing; triangulation problem; amortized; balanced divide and conquer; heterogeneous finger search tree; homogeneous finger search tree; horizontal visibility information; Jordan sorting with error-correction
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
52-04: Software, source code, etc. for problems pertaining to convex and discrete geometry
52A10: Convex sets in (2) dimensions (including convex curves)