Title :
A time-optimal algorithm for guard zone problem
Author :
Mehera, Ranjan ; Chatterjee, Sarit ; Pal, Rajat K.
Author_Institution :
Univ. of Calcutta, Kolkata
fDate :
Oct. 30 2007-Nov. 2 2007
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.
Keywords :
computational geometry; Euclidean distance; guard zone problem; time-optimal sequential algorithm; Algorithm design and analysis; Binary trees; Circuits; Computational complexity; Computational geometry; Computer science; Convolution; Euclidean distance; Heuristic algorithms; Very large scale integration; Analytical geometry; Computational geometry; Coordinate geometry; Resizing of VLSI circuits;
Conference_Titel :
TENCON 2007 - 2007 IEEE Region 10 Conference
Conference_Location :
Taipei
Print_ISBN :
978-1-4244-1272-3
Electronic_ISBN :
978-1-4244-1272-3
DOI :
10.1109/TENCON.2007.4429149
