Abstract
Given a simple polygon P, its guard zone G (of width r) is a closed region consisting of straight line segments and circular arcs (of radius r) bounding the polygon P such that there exists no pair of points p (on the boundary of P) and q (on the boundary of G) having their Euclidean distance d(p,q) less than r. In this paper we have designed a time-optimal sequential algorithm to solve the guard zone problem, and developed a cost-optimal parallel counterpart of the same problem for solving it in distributed environment.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Berlin (1997)
Chazelle, B.: Triangulating a Simple Polygon in Linear Time. Discrete Computational Geometry 6, 485–524 (1991)
Hernandez-Barrera, A.: Computing the Minkowski Sum of Monotone Polygons. IEICE Trans. on Information Systems E80-D(2), 218–222 (1996)
Hwang, K.: Advanced Computer Architecture: Parallelism, Scalability, Programmability. McGraw Hill, New York (1993)
Hwang, K., Briggs, F.A.: Computer Architecture and Parallel Processing. McGraw-Hill, New York (1984)
Nandy, S.C., Bhattacharya, B.B., Hernandez-Barrera, A.: Safety Zone Problem. Journal of Algorithms 37, 538–569 (2000)
Patterson, D.A., Hennesy, J.L.: Computer Architecture: A Quantitative Approach, 2nd edn. Morgan Kaufman, San Francisco (1996)
Pottmann, H., Wallner, J.: Computational Line Geometry. Springer, Berlin (1997)
Quinn, M.J.: Parallel Computing: Theory and Practice, 2nd edn. McGraw-Hill, New York (1994)
Ramkumar, G.D.: An Algorithm to Compute the Minkowski Sum Outer Face of Two Simple Polygons. In: Proc. of the 12th Annual ACM Symposium on Computational Geometry, pp. 234–241. Association for Computing Machinery, New York (1996)
Sherwani, N.A.: Algorithms for VLSI Physical Design Automation. Kluwer Academic, Boston (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mehera, R., Pal, R.K. (2008). A Cost-Optimal Algorithm for Guard Zone Problem. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds) Distributed Computing and Networking. ICDCN 2009. Lecture Notes in Computer Science, vol 5408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92295-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-92295-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92294-0
Online ISBN: 978-3-540-92295-7
eBook Packages: Computer ScienceComputer Science (R0)