On the Hausdorff Voronoi Diagram of Point Clusters in the Plane [chapter]

Evanthia Papadopoulou
2003 Lecture Notes in Computer Science  
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
more » ... tance from set A to B is h(A, B) = {maxa∈A min b∈B d(a, b)}. The Hausdorff distance between A and B is d h (A, B) = max{h(A, B), h(B, A)}.
doi:10.1007/978-3-540-45078-8_38 fatcat:ghvta5jlufchnpomxnvfed3opq