Abstract
In this work we present a CGAL (Computational Geometry Algorithm Library) implementation of the line segment Voronoi diagram under the L ∞ metric, building on top of the existing line segment Voronoi diagram under the Euclidean (L 2) metric in CGAL. CGAL is an open-source collection of geometric algorithms implemented in C++, used in both academia and industry. We also discuss an application of the L ∞ segment Voronoi diagram in the area of VLSI pattern analysis. In particular, we identify potentially critical locations in VLSI design patterns, where a pattern, when printed, may differ substantially from the original intended VLSI design, improving on existing methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abdo, A., Viswanathan, R.: The feasibility of using image parameters for test pattern selection during OPC model calibration. In: Proc. SPIE, vol. 7640, p. 76401E (2010)
Aichholzer, O., Aurenhammer, F.: Straight skeletons for general polygonal figures in the plane. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol. 1090, pp. 117–126. Springer, Heidelberg (1996)
Aurenhammer, F., Klein, R., Lee, D.T.: Voronoi Diagrams and Delaunay Triangulations. World Scientific Publishing Company, Singapore (2013)
Burnikel, C., Mehlhorn, K., Schirra, S.: How to compute the Voronoi diagram of line segments: Theoretical and experimental results. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 227–239. Springer, Heidelberg (1994)
Devillers, O.: The Delaunay hierarchy. International Journal of Foundations of Computer Science 13, 163–180 (2002)
Karavelas, M.: A robust and efficient implementation for the segment Voronoi diagram. In: International Symposium on Voronoi Diagrams in Science and Engineering, pp. 51–62 (2004)
Liotta, G., Preparata, F.P., Tamassia, R.: Robust proximity queries: An illustration of degree-driven algorithm design. SIAM Journal on Computing 28(3), 864–889 (1998)
Papadopoulou, E.: Net-aware critical area extraction for opens in VLSI circuits via higher-order Voronoi diagrams. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 30(5), 704–716 (2011)
Papadopoulou, E., Lee, D.T.: The L ∞ Voronoi diagram of segments and VLSI applications. International Journal of Computational Geometry and Application 11(5), 502–528 (2001)
Voronoi CAA: Voronoi Critical Area Analysis. IBM CAD Tool, Department of Electronic Design Automation, IBM Microelectronics Division, Burlington, VT, initial patents: US6178539, US6317859
Yap, C., Dubé, T.: The exact computation paradigm. In: Computing in Euclidean Geometry, pp. 452–492 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheilaris, P., Dey, S.K., Gabrani, M., Papadopoulou, E. (2014). Implementing the L ∞ Segment Voronoi Diagram in CGAL and Applying in VLSI Pattern Analysis. In: Hong, H., Yap, C. (eds) Mathematical Software – ICMS 2014. ICMS 2014. Lecture Notes in Computer Science, vol 8592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44199-2_32
Download citation
DOI: https://doi.org/10.1007/978-3-662-44199-2_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44198-5
Online ISBN: 978-3-662-44199-2
eBook Packages: Computer ScienceComputer Science (R0)