Abstract
The guard zone computation problem finds vast applications in the field of VLSI physical design automation and design of embedded systems, where one of the major purposes is to find an optimized way to place a set of 2D blocks on a chip floor. 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 . In this paper, we introduce the problem in its 3D version. Considering 3D simple solid objects makes the guard zone computation problem more complex and helps to solve many real life problems like VLSI physical design, Geographical Information System, motion control in robotics, and embedded systems. In this paper, we develop an algorithm to compute guard zone of a 3D solid object detecting and excluding overlapped regions among the guard zonal regions, if any.
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
References
Heywood, I., Cornelius, S., Carver, S.: An Introduction to Geographical Information Systems. Addison Wesley Longman, New York (1998)
Pottmann, H., Wallner, J.: Computational Line Geometry. Springer, Berlin (1997)
Lee, I.-K., Kimand, M.-S., Elber, G.: Polynomial/rational approximation of minkowski sum boundary curves (Article No.: IP970464). Graph. Models Image Process. 60(2), 136–165 (1998)
Mehlhorn, K.: Data Structures and Algorithms 3: Multi-Dimensional Searching and Computational Geometry. Springer (1984); 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 Comput. Geom. 6, 485–524 (1991)
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) (Four pages). Taipei (2007)
Mehera, R., Chatterjee, S., Pal, R.K.: Yet another linear time algorithm for guard zone problem. Icfai J. Comput. Sci. II(3), 14–23 (2008)
Mehera, R., Chakraborty, A., Datta, P., Pal, R.K.: An innovative approach towards detection and exclusion of overlapped regions in guard zone computation. In: Proceedings of 3rd International Conference on Computer, Communication, Control and Information Technology (C3IT 2015), pp. 1–6. Academy of Technology, West Bengal (2015)
Hwang, K., Briggs, F.A.: Computer Architecture and Parallel Processing. McGraw-Hill, New York (1984)
Grewal, B.S.: Higher Engineering Mathematics, 39th edn. Khanna Publishers, Delhi India (2005). ISBN 81-7409-195-5
Chakravorty, J.G., Ghosh, P.R.: Analytical Geometry and Vector Analysis. U.N. Dhur and Sons Private Ltd., Kolkata (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer India
About this chapter
Cite this chapter
Mehera, R., Datta, P., Chakraborty, A., Pal, R.K. (2016). An Algorithm to Solve 3D Guard Zone Computation Problem. In: Chaki, R., Cortesi, A., Saeed, K., Chaki, N. (eds) Advanced Computing and Systems for Security. Advances in Intelligent Systems and Computing, vol 396. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2653-6_18
Download citation
DOI: https://doi.org/10.1007/978-81-322-2653-6_18
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2651-2
Online ISBN: 978-81-322-2653-6
eBook Packages: EngineeringEngineering (R0)