The following pages link to Farthest-polygon Voronoi diagrams (Q632728):
Displaying 12 items.
- The higher-order Voronoi diagram of line segments (Q261375) (← links)
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (Q283875) (← links)
- A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters (Q727968) (← links)
- Minimizing the diameter of a spanning tree for imprecise points (Q1709600) (← links)
- Stabbing circles for sets of segments in the plane (Q1742369) (← links)
- Convex-straight-skeleton Voronoi diagrams for segments and convex polygons (Q2037112) (← links)
- On farthest Voronoi cells (Q2332415) (← links)
- ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM (Q2932519) (← links)
- Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function (Q2971631) (← links)
- Abstract Voronoi Diagrams from Closed Bisecting Curves (Q3132921) (← links)
- The L∞ Hausdorff Voronoi Diagram Revisited (Q3449121) (← links)
- Farthest-point Voronoi diagrams in the presence of rectangular obstacles (Q6174812) (← links)
