DOI: 10.1007/978-3-540-45078-8_38
关键词:
摘要: We study the Hausdorff Voronoi diagram of point clusters in plane and derive a tight combinatorial bound on its structural complexity. present sweep algorithm for construction this improving upon previous results. Motivation investigation type comes from problem computing critical area VLSI Layout, measure reflecting sensitivity design to spot defects during manufacturing.