Pages that link to "Item:Q1849744"
From MaRDI portal
The following pages link to Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane (Q1849744):
Displaying 7 items.
- An optimal parallel algorithm for triangulating a set of points in the plane (Q1100899) (← links)
- On parallel computation of Voronoi diagrams (Q1123595) (← links)
- A randomized algorithm for the Voronoi diagram of line segments on coarse-grained multiprocessors (Q1125809) (← links)
- Optimal computation of the Voronoi diagram of disjoint clusters (Q1603454) (← links)
- (Q4474217) (← links)
- A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions (Q5929327) (← links)
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs (Q6168083) (← links)