Pages that link to "Item:Q5096154"
From MaRDI portal
The following pages link to Parallel computation of discrete Voronoi diagrams (Q5096154):
Displaying 10 items.
- On parallel computation of Voronoi diagrams (Q1123595) (← links)
- Parallel computation of distance transforms (Q1175646) (← links)
- Computational geometry algorithms for the systolic screen (Q1175650) (← links)
- An improved parallel algorithm for constructing Voronoi diagram on a mesh-connected computer (Q1179250) (← links)
- Fine-grain discrete Voronoi diagram algorithms in \(L_1\) and \(L_\infty\) norms (Q1381794) (← links)
- Some results on the computation of Voronoi diagrams on a mesh with multiple broadcasting. (Q1426224) (← links)
- Optimal computation of the Voronoi diagram of disjoint clusters (Q1603454) (← links)
- A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations (Q2381920) (← 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)
