Voronoi diagram for multiply-connected polygonal domains 1: algorithm
IBM Journal of Research and Development
Voronoi diagram for multiply-connected polygonal domains 11: implementation and application
IBM Journal of Research and Development
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Critical area computation—a new approach
ISPD '98 Proceedings of the 1998 international symposium on Physical design
Straight Skeletons for General Polygonal Figures in the Plane
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Robust Proximity Queries in Implicit Voronoi Diagrams
Robust Proximity Queries in Implicit Voronoi Diagrams
| Hi-index | 0.00 |
In this paper we address the L∞ Voronoi diagram of polygonal objects and present applications in VLSI layout and manufacturing. We show that in L∞ the Voronoi diagram of segments consists only of straight line segments and is thus much simpler to compute than its Euclidean counterpart. Moreover, it has a natural interpretation. In applications where Euclidean precision is not particularly important the L∞ Voronoi diagram can provide a better alternative. Using the L∞ 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 problem in VLSI yield prediction.