Pages that link to "Item:Q5056167"

The following pages link to A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon (Q5056167):

Displaying 15 items.

• A linear-time algorithm for computing the Voronoi diagram of a convex polygon (Q911267) (← links)
• Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (Q919827) (← links)
• On parallel computation of Voronoi diagrams (Q1123595) (← 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)
• Computing convex-straight-skeleton Voronoi diagrams for segments and convex polygons (Q1790962) (← links)
• Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane (Q1849744) (← links)
• ``The big sweep'': On the power of the wavefront approach to Voronoi diagrams (Q2365174) (← links)
• Computing the L 1-diameter and center of a simple rectilinear polygon in parallel (Q5054772) (← links)
• “The big sweep”: On the power of the wavefront approach to Voronoi diagrams (Q5096887) (← links)
• (Q5289053) (← 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)