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. © 2015 IEEE.

RAJAT PAL

Computer Science and Engineering

R MEHERA

A CHAKRABORTY

P DATTA

University of Calcutta (informally known as Calcutta University or CU) is a collegiate public state university located in Kolkata, West Bengal, India.&nbsp;Within India it is recognized as a &quot;Five-Star University&quot; and accredited &quot;A&quot; Grade by National Assessment and Accreditation Council.

&nbsp;

The University of Calcutta has secured the Fifth position among the Universities of India in the prestigious &quot;Indian University Ranking 2019&quot; list, released by the NIRF of the Ministry of Human Resource Development, Government of India.

&nbsp;

It was established on 24 January 1857, and was one of the first institutions in Asia to be established as a multidisciplinary and Western-style university. Its alumni and faculty include several heads of state, heads of government, social reformers, prominent artists, only academy award winner and Dirac medal winner in India, many Fellows of the Royal Society and five Nobel laureates as of 2019 which is highest in South Asia.

University Of Calcutta

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

19th International Symposium on VLSI Design and Test, VDAT 2015 - Proceedings

The guard zone computation problem finds vast applications in the field of VLSI physical design automation and design of embedded systems, where one of the major purposes is to find an optimized way to place a set of 2D blocks on a chip floor. In VLSI layout design, the circuit components (or the functional units/modules or groups/blocks of different subcircuits) are not supposed to be placed much closer to each other in order to avoid electrical (parasitic) effects among them (http://en.wikipedia.org/wiki/Curve_orientation, [13]). The (group of) circuit components on a chip floor may be viewed as a set of polygonal regions on a two-dimensional plane. Each (group of) circuit component(s) C i is associated with a parameter δ i such that a minimum clearance zone of width δ i is to be maintained around C i. The regions representing the (groups of) circuit components are in general isothetic polygons, but may not always be limited to convex ones. The location of the guard zone (of specified width) for a simple polygon is a very important problem for resizing the (group of) circuit components. In this paper, we have developed an algorithm to compute the guard zone of a simple polygon as well as to exclude the overlapped regions among the guard zones, if any. If the number of vertices in the given polygon is n, then our algorithm requires O(n log n + I log n) time, where I is the number of intersections among the guard zones. So, it is output sensitive in nature that depends on the value of δ i. The algorithm developed in the paper is proved to report a preferred guard zone of the given simple polygon excluding all the intersections, if any. © Springer India 2015.

Advances in Intelligent Systems and Computing

A 2D Guard Zone Computation Algorithm for Reassignment of Subcircuits to Minimize the Overall Chip Area

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.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A cost-optimal algorithm for guard zone problem

International journal of geographical information systems

Evaluating field-based GIS for environmental characterization, modelling and decision support

Algorithms for VLSI Physical Design Automation

VLSI Physical Design Automation

Proceedings of the first annual ACM symposium on Parallel algorithms and architectures  - SPAA '89

Intersecting line segments in parallel with an output-sensitive number of processors

Journal	Data powered by Typeset19th International Symposium on VLSI Design and Test, VDAT 2015 - Proceedings
Publisher	Data powered by TypesetInstitute of Electrical and Electronics Engineers Inc.
Open Access	No