THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH

DOI10.1142/S0218195904001536zbMath1101.68914MaRDI QIDQ5711095

Evanthia Papadopoulou, Der-Tsai Lee

Publication date: 9 December 2005

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

zbMATH Keywords

Voronoi diagramHausdorff distancedivide and conquerHausdorff-hullvia-block defectsvlsi critical areavlsi yield

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Related Items (7)

The L∞ Hausdorff Voronoi Diagram Revisited ⋮ ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM ⋮ New results on stabbing segments with a polygon ⋮ Computing the map of geometric minimal cuts ⋮ Stabbing circles for sets of segments in the plane ⋮ A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters ⋮ Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended

Cites Work

• Randomized incremental construction of abstract Voronoi diagrams
• The upper envelope of piecewise linear functions: Algorithms and applications
• Concrete and abstract Voronoi diagrams
• The upper envelope of Voronoi surfaces and its applications
• Using generic programming for designing a data structure for polyhedral surfaces
• Parting directions for mould and die design
• A combinatorial property of convex sets
• The Hausdorff Voronoi diagram of point clusters in the plane
• THE L_∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS
• Unnamed Item

This page was built for publication: THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH