THE L∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS
From MaRDI portal
Publication:4682157
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
Cites work
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
- scientific article; zbMATH DE number 1979526 (Why is no real title available?)
- 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
- Computing the map of geometric minimal cuts
- Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction
- THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH
- Robustness of k-gon Voronoi diagram construction
- Implementing the \(L _{ \infty }\) segment Voronoi diagram in CGAL and applying in VLSI pattern analysis
- Farthest-point Voronoi diagrams in the presence of rectangular obstacles
- 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)