Title :
A cost-optimal algorithm for guard zone computation including detection and exclusion of overlapping
Author :
Mehera, Ranjan ; Chakraborty, Arpan ; Datta, Piyali ; Pal, Rajat Kumar
Author_Institution :
Dept. of Comput. Sci. & Eng., Univ. of Calcutta A. P. C. Roy Siksha Prangan, Kolkata, India
Abstract :
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.
Keywords :
VLSI; VLSI circuits; cost-optimal algorithm; distributed environment; guard zone computation; straight line segments; Algorithm design and analysis; Arrays; Context; Embedded systems; Program processors; Very large scale integration; CREW PRAM model; Guard zone; Notch; Simple polygon; VLSI circuit resizing;
Conference_Titel :
VLSI Design and Test (VDAT), 2015 19th International Symposium on
Conference_Location :
Ahmedabad
Print_ISBN :
978-1-4799-1742-6
DOI :
10.1109/ISVDAT.2015.7208086
