Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction

DOI10.1007/978-3-540-77120-3_62zbMath1193.68271OpenAlexW1535295259MaRDI QIDQ5387806

Evanthia Papadopoulou

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_62

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Mathematical problems of computer architecture (68M07)

Related Items (2)

Computing the map of geometric minimal cuts ⋮ Map of Geometric Minimal Cuts for General Planar Embedding

Uses Software

• Algorithm 447

Cites Work

• Unnamed Item
• Farthest line segment Voronoi diagrams
• The Hausdorff Voronoi diagram of point clusters in the plane
• An Improved Algorithm for Constructing kth-Order Voronoi Diagrams
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
• THE L_∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS
• Dividing a Graph into Triconnected Components
• Depth-First Search and Linear Graph Algorithms
• A new duality result concerning Voronoi diagrams

This page was built for publication: Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction