Abstract
The guard zone computation problem claims utmost importance in VLSI layout design, where the circuit components (or the functional units/modules or groups/blocks of different sub-circuits) that may be viewed as a set of polygonal regions on a two-dimensional plane, are not supposed to be placed much closer to each other in order to avoid electrical (parasitic) effects among them. Each (group of) circuit component(s) C i is associated with a parameter δ i such that a minimum clearance zone of width δ i is to be maintained around C i . Beyond this, it has huge significance in the field of robotic motion planning, geographical information system, automatic monitoring of metal cutting tools, and design of any embedded systems. If the guard zonal regions overlap, we have to remove the overlapped regions in order to compute the resultant outer guard zone (sometimes inner guard zones are also an issue to be considered). In this paper, we have developed an algorithm to compute the guard zone of a simple polygon as well as to exclude the overlapped regions among the guard zonal segments (if any) in O(n log n) time, where n is the number of vertices of the given simple polygon.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bajaj, C., Kim, M.-S.: Generation of configuration space obstacles: the case of a moving algebraic curves. Algorithmica 4(2), 157–172 (1989)
Chazelle, B.: Triangulating a simple polygon in linear time. Discrete Computat. Geom. 6, 485–524 (1991)
Harnandez-Barrera, A.: Computing the Minkowski sum of monotone polygons. IEICE Trans. Inf. Syst. E80-D(2), 218–222 (1996)
Heywood, I., Cornelius, S., Carver, S.: An Introduction to Geographical Information Systems. Addison Wesley Longman, New York (1998)
Lee, I.-K., Kimand, M.-S., Elber, G.: Polynomial/rational approximation of Minkowski sum boundary curves. Graph. Models Image Process. 60(2), 136–165 (1998). (Article No.: IP970464)
Mehera, R., Chakraborty, A., Datta, P., Pal, R.K.: A 2D guard zone computation algorithm for reassignment of subcircuits to minimize the overall chip area. In: Proceedings of the International Doctoral Symposium on Applied Computation and Security Systems (ACSS-2014), 18–20 Apr 2014
Mehera, R., Chatterjee, S., Pal, R.K.: A time-optimal algorithm for guard zone problem. In: Proceedings of 22nd IEEE Region 10 International Conference on Intelligent Information Communication Technologies for Better Human Life (IEEE TENCON 2007), CD: Session: ThCP-P.2 (Computing) 4 pages, Taipei, Taiwan (2007)
Mehera, R., Pal, R.K.: A cost-optimal algorithm for guard zone problem. In: Proceedings of 10th International Conference on Distributed Computing and Networking (ICDCN 2009), pp. 91–98, Hyderabad, India (2009)
Mehera, R., Chakraborty, A., Datta, P., Pal, R.K.: A comprehensive approach towards guard zone computation detecting and excluding the overlapped regions. Accepted for the Proceedings of the International Conference on Electrical and Computer Engineering (ICECE-2014) to be held on 20–22 Dec 2014, Dhaka, Bangladesh
Nandy, S.C., Bhattacharya, B.B., Hernandez-Barrera, A.: Safety zone problem. J. Algorithms 37, 538–569 (2000)
Sherwani, N.A.: Algorithms for VLSI physical design automation. Kluwer Academic, Boston (1993)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer India
About this paper
Cite this paper
Mehera, R., Chakraborty, A., Datta, P., Pal, R.K. (2015). Advancement in Guard Zone Computation Through Detection and Exclusion of the Overlapped Regions. In: Mandal, J., Satapathy, S., Kumar Sanyal, M., Sarkar, P., Mukhopadhyay, A. (eds) Information Systems Design and Intelligent Applications. Advances in Intelligent Systems and Computing, vol 340. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2247-7_56
Download citation
DOI: https://doi.org/10.1007/978-81-322-2247-7_56
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2246-0
Online ISBN: 978-81-322-2247-7
eBook Packages: EngineeringEngineering (R0)