A Cost-Optimal Algorithm for Guard Zone Problem

Authors:
Ranjan Mehera;Rajat K. Pal
Affiliations:
Subex Limited, Adarsh Tech Park, Bangalore, India 560 037;Dept. of Computer Sc. & Engg., University of Calcutta, Kolkata, India 700 009
Venue:
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Year:
2009

Citing 9
Cited 0

Computer architecture: a quantitative approach

Computer architecture: a quantitative approach
Triangulating a simple polygon in linear time

Discrete & Computational Geometry
Parallel computing (2nd ed.): theory and practice

Parallel computing (2nd ed.): theory and practice
An algorithm to compute the Minkowski sum outer-face of two simple polygons

Proceedings of the twelfth annual symposium on Computational geometry
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Safety zone problem

Journal of Algorithms
Algorithms for VLSI Physical Design Automation

Algorithms for VLSI Physical Design Automation
Advanced Computer Architecture: Parallelism,Scalability,Programmability

Advanced Computer Architecture: Parallelism,Scalability,Programmability
Computer Architecture and Parallel Processing

Computer Architecture and Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

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.