Header menu link for other important links
X
A time-optimal algorithm for guard zone problem
R MEHERA, S CHATTERJEE,
Published in -
2007
Pages: 1 - 4
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. ©2007 IEEE.
About the journal
JournalIEEE Region 10 Annual International Conference, Proceedings/TENCON
Publisher-
Open AccessNo