An optimal parallel algorithm for triangulating a set of points in the plane

DOI10.1007/BF01414464zbMath0641.68068MaRDI QIDQ1100899

Ed Merks

Publication date: 1986

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

zbMATH Keywords

triangulationconvex hulllower boundparallel algorithmCREW PRAMdivide-and-conquercomputatioal geometry

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10) Theory of operating systems (68N25)

Related Items (2)

An optimal speed-up parallel algorithm for triangulating simplicial point sets in space ⋮ Parallel general prefix computations with geometric, algebraic, and other applications

Cites Work

• Sorting in \(c \log n\) parallel steps
• An optimal speed-up parallel algorithm for triangulating simplicial point sets in space
• Automatic triangulation of arbitrary planar domains for the finite element method
• Parallelism in random access machines

This page was built for publication: An optimal parallel algorithm for triangulating a set of points in the plane