Header menu link for other important links
A cost-optimal algorithm for guard zone problem
Published in -
Volume: 5408 LNCS
Pages: 91 - 98
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. © 2009 Springer.
About the journal
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Open AccessNo