Map of geometric minimal cuts for general planar embedding

DOI10.1007/978-3-319-03780-6_21MaRDI QIDQ2867123zbMATH OpenOpenAlexFDO

Authors Evanthia Papadopoulou, Jinhui Xu, Lei Xu

Publication date 10 December 2013

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-03780-6_21

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Computing the map of geometric minimal cuts
• Computing the Map of Geometric Minimal Cuts
• THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH
• The Hausdorff Voronoi diagram of point clusters in the plane
• The higher order Hausdorff Voronoi diagram and VLSI critical area extraction for via-blocks

Cites work

• A combinatorial property of convex sets
• A sweepline algorithm for Voronoi diagrams
• Computing the Map of Geometric Minimal Cuts
• Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction
• On the Farthest Line-Segment Voronoi Diagram

Cited in

(2)

• Computing the Map of Geometric Minimal Cuts
• Computing the map of geometric minimal cuts

This page was built for publication: Map of geometric minimal cuts for general planar embedding

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