A time-optimal parallel algorithm for the computing of Voronoi-diagrams

DOI10.1007/3-540-50728-0_60MaRDI QIDQ6199480zbMATH OpenFDO

Authors W. Preilowski

Publication date 28 February 2024

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-50728-0_60

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Recommendations

• On parallel computation of Voronoi diagrams
• scientific article; zbMATH DE number 4062598
• A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
• scientific article; zbMATH DE number 140455
• Constructing the Voronoi diagram of a set of line segments in parallel

Cites work

• scientific article; zbMATH DE number 3887061 (Why is no real title available?)
• Power Diagrams: Properties, Algorithms and Applications

This page was built for publication: A time-optimal parallel algorithm for the computing of Voronoi-diagrams

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