The L∞ Hausdorff Voronoi Diagram Revisited

DOI10.1142/S0218195915500089zbMath1343.68264MaRDI QIDQ3449121

Jinhui Xu, Evanthia Papadopoulou

Publication date: 3 November 2015

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

zbMATH Keywords

Voronoi diagramHausdorff distanceVLSI layoutpoint dominanceplane sweep\(L_\infty\) metric

Mathematics Subject Classification ID

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

Related Items (2)

A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters ⋮ Weighted Voronoi Diagrams in the Maximum Norm

Cites Work

• Computing the map of geometric minimal cuts
• Farthest-polygon Voronoi diagrams
• Randomized incremental construction of abstract Voronoi diagrams
• Abstract Voronoi diagrams revisited
• The upper envelope of piecewise linear functions: Algorithms and applications
• A sweepline algorithm for Voronoi diagrams
• The upper envelope of Voronoi surfaces and its applications
• A combinatorial property of convex sets
• Optimal computation of the Voronoi diagram of disjoint clusters
• The Hausdorff Voronoi diagram of point clusters in the plane
• ``The big sweep: On the power of the wavefront approach to Voronoi diagrams
• ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM
• Priority Search Trees
• THE L_∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS
• THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH

This page was built for publication: The L∞ Hausdorff Voronoi Diagram Revisited