An O(log n) time parallel algorithm for triangulating a set of points in the plane
From MaRDI portal
Publication:1107999
DOI10.1016/0020-0190(87)90093-7zbMath0653.68031OpenAlexW2022913729MaRDI QIDQ1107999
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(87)90093-7
Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Cites Work