ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM

DOI10.1142/S0218195913600121zbMath1317.68252MaRDI QIDQ2932519

Sandeep Kumar Dey, Evanthia Papadopoulou

Publication date: 1 December 2014

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

Voronoi diagramline segmentGaussian mapoutput-sensitive algorithmfarthest site\(L_{p}\) metricfarthest hull

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (8)

The L∞ Hausdorff Voronoi Diagram Revisited ⋮ Deletion in abstract Voronoi diagrams in expected linear time and related problems ⋮ Farthest-point Voronoi diagrams in the presence of rectangular obstacles ⋮ Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function ⋮ Dispersing and grouping points on planar segments ⋮ Stabbing circles for sets of segments in the plane ⋮ Convex-straight-skeleton Voronoi diagrams for segments and convex polygons ⋮ The higher-order Voronoi diagram of line segments

Cites Work

• Farthest-polygon Voronoi diagrams
• Farthest line segment Voronoi diagrams
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• Stabbing line segments
• Parting directions for mould and die design
• Optimal output-sensitive convex hull algorithms in two and three dimensions
• Two-Dimensional Voronoi Diagrams in the L _p -Metric
• Generalization of Voronoi Diagrams in the Plane
• FURTHEST SITE ABSTRACT VORONOI DIAGRAMS
• THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH

This page was built for publication: ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM