The following pages link to Farthest-Polygon Voronoi Diagrams (Q3527230):
Displaying 4 items.
- Improved algorithms for the farthest colored Voronoi diagram of segments (Q391216) (← links)
- On the central path problem (Q393050) (← links)
- Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments (Q2248734) (← links)
- Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere (Q3012849) (← links)
