Abstract
We present a new data structure for the representation of an integrated circuit layout. It is a modified HV/VH tree using arrays as the primary container in bisector lists and leaf nodes. By grouping and sorting objects within these arrays together with a customized binary search algorithm, our new data structure provides excellent performance in both memory usage and region query speed. Experimental results show that in comparison with the original HV/VH tree, which has been regarded as the best layout data structure to date, the new data structure uses much less memory and can become 30% faster on region query.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Berg, M.D., Cheong, O., Kreveld, M.V., Overmars, M., 2008. Computational Geometry: Algorithms and Applications. Springer, the Netherlands, p.219–238.
Brown, R.L., 1986. Multiple storage quad trees: a simpler faster alternative to bisector list quad trees. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst., 5(3):413–419. [doi:10.1109/TCAD.1986.1270210]
Kedem, G., 1982. The Quad-CIF Tree: a Data Structure for Hierarchical On-line Algorithms. Proc. 19th Design Automation Conf., p.352–357.
Lai, G.G., Fussell, D., Wong, D.F., 1993. HV/VH Trees: a New Spatial Data Structure for Fast Region Queries. Proc. 30th Int. Design Automation Conf., p.43–47. [doi:10.1145/157485.164562]
Lai, G.G., Fussell, D.S., Wong, D.F., 1996. Hinted quad trees for VLSI geometry DRC based on efficient searching for neighbors. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst., 15(3):317–324. [doi:10.1109/43.489102]
Mehta, D.P., 2005. Handbook of Data Structures and Applications. Chapter 52: Layout Data Structures. Chapman & Hall/CRC, USA, p.1046–1063.
Mehta, D.P., Zhou, H., 2008. Handbook of Algorithms for Physical Design Automation. Chapter 4: Basic Data Structures. Auerbach Publications, FL, USA, p.55–69.
Ousterhout, J.K., 1982. Corner stitching: a data structure technique for VLSI layout tools. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst., 3(1):87–100. [doi:10.1109/TCAD.1984.1270061]
Pitaksanonkul, A., Thanawastien, S., Lursinsap, C., 1989. Comparisons of quad trees and 4-D trees: new results. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst., 8(11):1157–1164. [doi:10.1109/43.41501]
Rosenberg, J.B., 1985. Geographical data structures compared: a study of data structures supporting region queries. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst., 4(1):53–67. [doi:10.1109/TCAD.1985.1270098]
Samet, H., 1990a. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, MA.
Samet, H., 1990b. The Design and Analysis of Spatial Data Structures. Addison-Wesley, MA.
Samet, H., 2006. Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann, CA, USA, p.474–483.
Weyten, L., de Pauw, W., 1989. Quad list quad trees: a geometrical data structure with improved performance for large region queries. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst., 8(3):229–233. [doi:10.1109/43.21842]
Author information
Authors and Affiliations
Corresponding author
Additional information
Project supported by the National Natural Science Foundation of China (No. 61106034) and the National Science and Technology Major Project (No. 2009ZX02023-004-1)
Rights and permissions
About this article
Cite this article
Ren, J., Pan, Ww., Zheng, Yj. et al. Array based HV/VH tree: an effective data structure for layout representation. J. Zhejiang Univ. - Sci. C 13, 232–237 (2012). https://doi.org/10.1631/jzus.C1100193
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1631/jzus.C1100193