A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
The Hausdorff Voronoi Diagram of Point Clusters in the Plane
2004
Algorithmica
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. 1 The (directed) Hausdorff
doi:10.1007/s00453-004-1095-0
fatcat:srwocwmk4bhtdluhaszz4s7fpu