Back to Search Start Over

The L[sub ∞] Voronoi Diagram of Segments and VLSI Applications.

The L[sub ∞] Voronoi Diagram of Segments and VLSI Applications.

Authors :
Papadopoulou, Evantha
Lee, D. T.
Preparata, F. P.
Source :
International Journal of Computational Geometry & Applications. Oct2001, Vol. 11 Issue 5, p503. 26p.
Publication Year :
2001

Abstract

In this paper we address the Lee Voronoi diagram of polygonal objects and present applications in VLSI layout and manufacturing. We show that the Lee Voronoi diagram of polygonal objects consists of straight line segments and thus it is much simpler to compute than its Euclidean counterpart; the degree of the computation is significantly lower. Moreover, it has a natural interpretation. In applications where Euclidean precision is not essential the Lee Voronoi diagram can provide a better alternative. Using the L[sub ∞] Voronoi diagram of polygons we address the problem of calculating the critical area for shorts in a VLSI layout. The critical area computation is the main computational bottleneck in VLSI yield prediction. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
02181959
Volume :
11
Issue :
5
Database :
Academic Search Index
Journal :
International Journal of Computational Geometry & Applications
Publication Type :
Academic Journal
Accession number :
7144751
Full Text :
https://doi.org/10.1142/S0218195901000626