On the Hausdorff Voronoi Diagram of Point Clusters in the Plane
We study the Hausdorff Voronoi diagram of point clusters in the plane and derive a tight combinatorial bound on its structural complexity. We present a plane sweep algorithm for the construction of this diagram improving upon previous results. Motivation for the investigation of this type of Voronoi diagram comes from the problem of computing the critical area of a VLSI Layout, a measure reflecting the sensitivity of the design to spot defects during manufacturing.
KeywordsConvex Hull Voronoi Diagram Point Cluster Voronoi Region Event Queue
Unable to display preview. Download preview PDF.