A nearly optimal deterministic parallel Voronoi diagram algorithm
From MaRDI portal
Publication:1817002
DOI10.1007/BF01944352zbMATH Open0860.68106OpenAlexW2099646511MaRDI QIDQ1817002FDOQ1817002
Richard Cole, Colm P. O'Dunlaing, Michael T. Goodrich
Publication date: 29 January 1997
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01944352
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallelism in Comparison Problems
- A sweepline algorithm for Voronoi diagrams
- Parallel Prefix Computation
- Some dynamic computational geometry problems
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- A new duality result concerning Voronoi diagrams
- Dynamic computational geometry on meshes and hypercubes
- Parallel algorithms for some functions of two convex polygons
- Searching, Merging, and Sorting in Parallel Computation
- Improved deterministic parallel integer sorting
- Parallel computational geometry
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- On the time required to sum n semigroup elements on a parallel machine with simultaneous writes
- On parallel computation of Voronoi diagrams
- Constructing the Voronoi diagram of a set of line segments in parallel
- Title not available (Why is that?)
- Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
Cited In (7)
- Optimal computation of the Voronoi diagram of disjoint clusters
- On parallel computation of Voronoi diagrams
- An improved parallel algorithm for constructing Voronoi diagram on a mesh-connected computer
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- An extension to \textsc{Voro++} for multithreaded computation of Voronoi cells
- A new parallel algorithm for constructing Voronoi tessellations from distributed input data
This page was built for publication: A nearly optimal deterministic parallel Voronoi diagram algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1817002)
