Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abellanas, M., Hernandez, G., Klein, R., Neumann-Lara, V., Urrutia, J.: A Combinatorial Property of Convex Sets. Discrete Computat. Geometry 17, 307–318 (1997)
Dehne, F., Klein, R.: “The Big Sweep”: On the power of the Wavefront Approach to Voronoi Diagrams”. Algorithmica 17, 19–32 (1997)
Edelsbrunner, H., Guibas, L.J., Sharir, M.: “The upper envelope of piecewise linear functions: algorithms and applications”. Discrete Computat. Geometry 4, 311–336 (1989)
Fortune, S.J.: A sweepline algorithm for Voronoi diagrams. Algorithmica 2, 153–174 (1987)
Klein, R., Mehlhorn, K., Meiser, S.: Randomized Incremental Construction of Abstract Voronoi diagrams. Computational geometry: Theory and Applications 3, 157–184 (1993)
Maly, W.: Computer Aided Design for VLSI Circuit Manufacturability. In: Proc. IEEE, vol. 78(2), pp. 356–392 (1990)
Papadopoulou, E.: Critical Area Computation for Missing Material Defects in VLSI Circuits. IEEE Transactions on Computer-Aided Design 20(5), 583–597 (2001)
Papadopoulou, E., Lee, D.T.: Critical Area Computation via Voronoi Diagrams. IEEE Trans. on Computer-Aided Design 18(4), 463–474 (1999)
Papadopoulou, E., Lee, D.T.: The Min-Max Voronoi diagram of polygonal objects and applications in VLSI manufacturing. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 511–522. Springer, Heidelberg (2002)
Preparata, F.P., Shamos, M.I.: Computational Geometry: an Introduction. Springer, New York (1985)
Walker, H., Director, S.W.: VLASIC: A yield simulator for integrated circuits. IEEE Trans. on Computer-Aided Design CAD-5(4), 541–556 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Papadopoulou, E. (2003). On the Hausdorff Voronoi Diagram of Point Clusters in the Plane. In: Dehne, F., Sack, JR., Smid, M. (eds) Algorithms and Data Structures. WADS 2003. Lecture Notes in Computer Science, vol 2748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45078-8_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-45078-8_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40545-0
Online ISBN: 978-3-540-45078-8
eBook Packages: Springer Book Archive