A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing
[chapter]
2002
Lecture Notes in Computer Science
We study the min-max Voronoi diagram of a set S of polygonal objects, a generalization of Voronoi diagrams based on the maximum distance between a point and a polygon. We show that the min-max Voronoi diagram is equivalent to the Voronoi diagram under the Hausdorff distance function. We investigate the combinatorial properties of this diagram and give improved combinatorial bounds and algorithms. As a byproduct we introduce the min-max hull which relates to the minmax Voronoi diagram in the way
doi:10.1007/3-540-36136-7_45
fatcat:l2gjmnkoyfejxnjferkopkpb7q