THE L∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS

DOI10.1142/S0218195901000626zbMath1074.68648OpenAlexW2153234773MaRDI QIDQ4682157

Evanthia Papadopoulou, Der-Tsai Lee

Publication date: 10 June 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195901000626

zbMATH Keywords

Voronoi diagramVLSI layout\(L_{\infty}\) metricalgorithmic degreescritical areas

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Related Items (13)

Minimum-link shortest paths for polygons amidst rectilinear obstacles ⋮ The L∞ Hausdorff Voronoi Diagram Revisited ⋮ Tiling with Squares and Packing Dominos in Polynomial Time ⋮ Farthest-point Voronoi diagrams in the presence of rectangular obstacles ⋮ VORONOI DIAGRAM OF A POLYGON IN CHESSBOARD METRIC AND MASKLESS LITHOGRAPHIC APPLICATIONS ⋮ Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction ⋮ Computing the map of geometric minimal cuts ⋮ Shortest rectilinear path queries to rectangles in a rectangular domain ⋮ THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH ⋮ Dynamic construction of abstract Voronoi diagrams ⋮ Weighted Voronoi Diagrams in the Maximum Norm ⋮ Robustness of \(k\)-gon Voronoi diagram construction ⋮ The \(k\)-nearest-neighbor Voronoi diagram revisited

Cites Work

• Evaluating signs of determinants using single-precision arithmetic
• A sweepline algorithm for Voronoi diagrams
• Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
• NUMERICAL STABILITY OF ALGORITHMS FOR 2D DELAUNAY TRIANGULATIONS

This page was built for publication: THE L_∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS