The Hausdorff Voronoi diagram of point clusters in the plane

DOI10.1007/s00453-004-1095-0zbMath1088.68175OpenAlexW2160009442MaRDI QIDQ1882526

Evanthia Papadopoulou

Publication date: 1 October 2004

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-004-1095-0

zbMATH Keywords

Voronoi diagramHausdorff distanceManufacturing defectsPlane sweepVia-blocksVLSI Critical AreaVLSI yield prediction

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

Related Items (13)

The L∞ Hausdorff Voronoi Diagram Revisited ⋮ An efficient randomized algorithm for higher-order abstract Voronoi diagrams ⋮ Deletion in abstract Voronoi diagrams in expected linear time and related problems ⋮ On Clustering Induced Voronoi Diagrams ⋮ Farthest-polygon Voronoi diagrams ⋮ Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction ⋮ New results on stabbing segments with a polygon ⋮ Computing the map of geometric minimal cuts ⋮ Stabbing circles for sets of segments in the plane ⋮ THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH ⋮ Influence-based Voronoi diagrams of clusters ⋮ A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters ⋮ Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended

This page was built for publication: The Hausdorff Voronoi diagram of point clusters in the plane