Anzeige
Erschienen in:
2003 | OriginalPaper | Buchkapitel
On the Hausdorff Voronoi Diagram of Point Clusters in the Plane
verfasst von : Evanthia Papadopoulou
Erschienen in: Algorithms and Data Structures
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.