Advancement in Guard Zone Computation Through Detection and Exclusion of the Overlapped Regions

  • Ranjan Mehera
  • Arpan Chakraborty
  • Piyali Datta
  • Rajat Kumar Pal
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 340)


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.


Simple polygon Safety zone Notch Convex hull False hull edge Convolution Minkowski sum 


  1. 1.
    Bajaj, C., Kim, M.-S.: Generation of configuration space obstacles: the case of a moving algebraic curves. Algorithmica 4(2), 157–172 (1989)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Chazelle, B.: Triangulating a simple polygon in linear time. Discrete Computat. Geom. 6, 485–524 (1991)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Harnandez-Barrera, A.: Computing the Minkowski sum of monotone polygons. IEICE Trans. Inf. Syst. E80-D(2), 218–222 (1996)Google Scholar
  4. 4.
    Heywood, I., Cornelius, S., Carver, S.: An Introduction to Geographical Information Systems. Addison Wesley Longman, New York (1998)Google Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    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 2014Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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, BangladeshGoogle Scholar
  10. 10.
    Nandy, S.C., Bhattacharya, B.B., Hernandez-Barrera, A.: Safety zone problem. J. Algorithms 37, 538–569 (2000)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Sherwani, N.A.: Algorithms for VLSI physical design automation. Kluwer Academic, Boston (1993)CrossRefMATHGoogle Scholar

Copyright information

© Springer India 2015

Authors and Affiliations

  • Ranjan Mehera
    • 1
  • Arpan Chakraborty
    • 1
  • Piyali Datta
    • 1
  • Rajat Kumar Pal
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of CalcuttaKolkataIndia

Personalised recommendations