Pages that link to "Item:Q1206435"
From MaRDI portal
The following pages link to Constructing the Voronoi diagram of a set of line segments in parallel (Q1206435):
Displaying 13 items.
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (Q283875) (← links)
- A randomized algorithm for the Voronoi diagram of line segments on coarse-grained multiprocessors (Q1125809) (← links)
- A nearly parallel algorithm for the Voronoi diagram of a convex polygon (Q1269914) (← links)
- A nearly optimal deterministic parallel Voronoi diagram algorithm (Q1817002) (← links)
- Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane (Q1849744) (← links)
- Finding a closet visible vertex pair between two polygons (Q1899450) (← links)
- Linear-size nonobtuse triangulation of polygons (Q1906045) (← links)
- Computing the topology of Voronoï diagrams of parallel half-lines (Q2071541) (← links)
- A parallel algorithm for computing Voronoi diagram of a set of circles using touching disc and topology matching (Q2127711) (← links)
- Bisectors and Voronoï Diagram of a Family of Parallel Half-Lines (Q3463626) (← links)
- A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon (Q5056167) (← links)
- Voronoi Diagrams for Parallel Halflines and Line Segments in Space (Q5136222) (← links)
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs (Q6168083) (← links)
