A cost-optimal algorithm for guard zone computation including detection and exclusion of overlapping

A cost-optimal algorithm for guard zone computation including detection and exclusion of overlapping The guard zone G (of width r) of a simple polygon P is a closed region consisting of a set of straight line segments and circular arcs (of radius r) bounding the said polygon 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 the specified value r. In this paper we have designed a cost-optimal (parallel) algorithm to solve the guard zone computation problem for solving it in distributed environment that finds application in resizing of VLSI circuits.