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 Haus-dorff 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 min-max Voronoi diagram in the way a convex hull relates to the ordinary Voronoi diagram. © Springer-Verlag Berlin Heidelberg 2002.
CITATION STYLE
Papadopoulou, E., & Lee, D. T. (2002). The min-max voronoi diagram of polygons and applications in VLSI manufacturing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2518 LNCS, pp. 511–522). https://doi.org/10.1007/3-540-36136-7_45
Mendeley helps you to discover research relevant for your work.