Merging free trees in parallel for efficient Voronoi diagram construction

DOI10.1007/BFB0032049MaRDI QIDQ4038709zbMATH OpenFDO

Authors Richard Cole, Michael T. Goodrich, Colm P. O'Dunlaing

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0032049

zbMATH Keywords

CREW PRAMdeterministic parallel construction of a Voronoi diagramproximity envelopeVoronoi fringe

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Recommendations

• An improved parallel algorithm for constructing Voronoi diagram on a mesh-connected computer
• On parallel computation of Voronoi diagrams
• scientific article; zbMATH DE number 4062598
• Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane
• Constructing the Voronoi diagram of a set of line segments in parallel

Cited in

(6)

• Constructing the Voronoi diagram of a set of line segments in parallel
• A nearly parallel algorithm for the Voronoi diagram of a convex polygon
• A nearly optimal deterministic parallel Voronoi diagram algorithm
• An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram
• A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
• New parallel algorithms for convex hull and triangulation in 3-dimensional space

This page was built for publication: Merging free trees in parallel for efficient Voronoi diagram construction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038709)