THE L∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS

DOI10.1142/S0218195901000626zbMATH Open1074.68648OpenAlexW2153234773MaRDI QIDQ4682157FDOQ4682157

Authors: 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

Recommendations

• The L∞ Hausdorff Voronoi Diagram Revisited
• Implementing the \(L _{ \infty }\) segment Voronoi diagram in CGAL and applying in VLSI pattern analysis
• THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH
• The higher order Hausdorff Voronoi diagram and VLSI critical area extraction for via-blocks
• Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (16)

• Shortest rectilinear path queries to rectangles in a rectangular domain
• Tiling with Squares and Packing Dominos in Polynomial Time
• The higher order Hausdorff Voronoi diagram and VLSI critical area extraction for via-blocks
• Title not available (Why is that?)
• Minimum-link shortest paths for polygons amidst rectilinear obstacles
• Dynamic construction of abstract Voronoi diagrams
• VORONOI DIAGRAM OF A POLYGON IN CHESSBOARD METRIC AND MASKLESS LITHOGRAPHIC APPLICATIONS
• The \(k\)-nearest-neighbor Voronoi diagram revisited
• Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction
• Computing the map of geometric minimal cuts
• THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH
• Farthest-point Voronoi diagrams in the presence of rectangular obstacles
• Implementing the \(L _{ \infty }\) segment Voronoi diagram in CGAL and applying in VLSI pattern analysis
• Robustness of \(k\)-gon Voronoi diagram construction
• Weighted Voronoi diagrams in the maximum norm
• The L∞ Hausdorff Voronoi Diagram Revisited

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682157)