The following pages link to (Q3716329):
Displaying 12 items.
- Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location (Q655203) (← links)
- Computing Euclidean maximum spanning trees (Q911288) (← links)
- Fast algorithms for computing the diameter of a finite planar set (Q1104078) (← links)
- On the multimodality of distances in convex polygons (Q1165585) (← links)
- Computing largest empty circles with location constraints (Q3039008) (← links)
- Complexity, convexity, and unimodality (Q3219150) (← links)
- (Q3221723) (← links)
- Robust Point-Location in Generalized Voronoi Diagrams (Q3628374) (← links)
- (Q4028875) (← links)
- The optimal algorithm for dynamic support of the Voronoi Diagram for a set of points (Q4991375) (← links)
- On farthest Bregman Voronoi cells (Q5077159) (← links)
- VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments (Q5943290) (← links)
