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 5 items.
- A nearly optimal deterministic parallel Voronoi diagram algorithm (Q1817002) (← links)
- Finding a closet visible vertex pair between two polygons (Q1899450) (← links)
- Linear-size nonobtuse triangulation of polygons (Q1906045) (← links)
- A parallel algorithm for computing Voronoi diagram of a set of circles using touching disc and topology matching (Q2127711) (← links)
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs (Q6168083) (← links)
