Pages that link to "Item:Q1123595"
From MaRDI portal
The following pages link to On parallel computation of Voronoi diagrams (Q1123595):
Displaying 14 items.
- A new parallel algorithm for constructing Voronoi tessellations from distributed input data (Q525736) (← links)
- Parallel Voronoi diagram in \(L_ 1(L_{\infty})\) metric on a mesh- connected computer (Q808303) (← links)
- An improved parallel algorithm for constructing Voronoi diagram on a mesh-connected computer (Q1179250) (← links)
- Constructing the Voronoi diagram of a set of line segments in parallel (Q1206435) (← links)
- A nearly parallel algorithm for the Voronoi diagram of a convex polygon (Q1269914) (← links)
- Some results on the computation of Voronoi diagrams on a mesh with multiple broadcasting. (Q1426224) (← links)
- A nearly optimal deterministic parallel Voronoi diagram algorithm (Q1817002) (← links)
- Voronoi-like partition of lattice in cellular automata (Q1914936) (← links)
- Computing the topology of Voronoï diagrams of parallel half-lines (Q2071541) (← links)
- A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon (Q5056167) (← links)
- Parallel computation of discrete Voronoi diagrams (Q5096154) (← links)
- A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions (Q5929327) (← links)
- An extension to \textsc{Voro++} for multithreaded computation of Voronoi cells (Q6112685) (← links)
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs (Q6168083) (← links)
