Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction (Q5387806): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Hausdorff Voronoi diagram of point clusters in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Farthest line segment Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE L<sub>∞</sub> VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-Nearest Neighbor Voronoi Diagrams in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new duality result concerning Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Algorithm for Constructing kth-Order Voronoi Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dividing a Graph into Triconnected Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945505 / rank
 
Normal rank

Latest revision as of 09:55, 28 June 2024

scientific article; zbMATH DE number 5279493
Language Label Description Also known as
English
Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction
scientific article; zbMATH DE number 5279493

    Statements

    Identifiers