The following pages link to (Q4525679):
Displaying 10 items.
- Abstract Voronoi diagrams revisited (Q833716) (← links)
- A nearly parallel algorithm for the Voronoi diagram of a convex polygon (Q1269914) (← links)
- Forest-like abstract Voronoi diagrams in linear time (Q1699286) (← links)
- Minimizing the diameter of a spanning tree for imprecise points (Q1709600) (← links)
- On selecting a fraction of leaves with disjoint neighborhoods in a plane tree (Q2161244) (← links)
- The geodesic farthest-point Voronoi diagram in a simple polygon (Q2309478) (← links)
- A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon (Q5056167) (← links)
- (Q5115770) (← links)
- Deletion in Abstract Voronoi Diagrams in Expected Linear Time. (Q5115818) (← links)
- Deletion in abstract Voronoi diagrams in expected linear time and related problems (Q6045784) (← links)