On parallel computation of Voronoi diagrams
From MaRDI portal
Publication:1123595
DOI10.1016/0167-8191(89)90011-2zbMATH Open0677.68014OpenAlexW1996514667MaRDI QIDQ1123595FDOQ1123595
Authors: D. J. Evans, Ivan Stojmenović
Publication date: 1989
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8191(89)90011-2
Recommendations
- Parallel computation of discrete Voronoi diagrams (extended abstract)
- A nearly optimal deterministic parallel Voronoi diagram algorithm
- scientific article; zbMATH DE number 4062598
- A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
- An improved parallel algorithm for constructing Voronoi diagram on a mesh-connected computer
- A nearly parallel algorithm for the Voronoi diagram of a convex polygon
- A new parallel algorithm for constructing Voronoi tessellations from distributed input data
- Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane
- Parallel Voronoi diagram in \(L_ 1(L_{\infty})\) metric on a mesh- connected computer
- An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram
Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10) Theory of operating systems (68N25)
Cited In (19)
- Title not available (Why is that?)
- A nearly optimal deterministic parallel Voronoi diagram algorithm
- Some results on the computation of Voronoi diagrams on a mesh with multiple broadcasting.
- 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
- Title not available (Why is that?)
- Voronoi-like partition of lattice in cellular automata
- Calculating Voronoi diagrams using simple chemical reactions
- Parallel computation of discrete Voronoi diagrams (extended abstract)
- A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions
- A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing the topology of Voronoï diagrams of parallel half-lines
- Title not available (Why is that?)
- Constructing the Voronoi diagram of a set of line segments in parallel
- An extension to \textsc{Voro++} for multithreaded computation of Voronoi cells
- ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS
- A new parallel algorithm for constructing Voronoi tessellations from distributed input data
This page was built for publication: On parallel computation of Voronoi diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123595)