An O(log n) time parallel algorithm for triangulating a set of points in the plane

DOI10.1016/0020-0190(87)90093-7zbMath0653.68031OpenAlexW2022913729MaRDI QIDQ1107999

Cao An Wang, Yung Hyang Tsin

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

zbMATH Keywords

parallel algorithmcomputational geometrytriangulation of point sets

Mathematics Subject Classification ID

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

• Unnamed Item
• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• Routing, merging, and sorting on parallel models of computation
• Parallel computational geometry
• Maintenance of configurations in the plane
• Parallelism in Comparison Problems