Pages that link to "Item:Q4682157"
From MaRDI portal
The following pages link to THE L<sub>∞</sub> VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS (Q4682157):
Displayed 13 items.
- Computing the map of geometric minimal cuts (Q476438) (← links)
- Robustness of \(k\)-gon Voronoi diagram construction (Q1045919) (← links)
- Minimum-link shortest paths for polygons amidst rectilinear obstacles (Q2123290) (← links)
- The \(k\)-nearest-neighbor Voronoi diagram revisited (Q2346966) (← links)
- Dynamic construction of abstract Voronoi diagrams (Q2519174) (← links)
- The L∞ Hausdorff Voronoi Diagram Revisited (Q3449121) (← links)
- VORONOI DIAGRAM OF A POLYGON IN CHESSBOARD METRIC AND MASKLESS LITHOGRAPHIC APPLICATIONS (Q3527442) (← links)
- Weighted Voronoi Diagrams in the Maximum Norm (Q5241379) (← links)
- Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction (Q5387806) (← links)
- THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH (Q5711095) (← links)
- Shortest rectilinear path queries to rectangles in a rectangular domain (Q5896842) (← links)
- Tiling with Squares and Packing Dominos in Polynomial Time (Q6051995) (← links)
- Farthest-point Voronoi diagrams in the presence of rectangular obstacles (Q6174812) (← links)