Map of Geometric Minimal Cuts for General Planar Embedding

DOI10.1007/978-3-319-03780-6_21zbMath1406.68125OpenAlexW155546234MaRDI QIDQ2867123

Evanthia Papadopoulou, Lei Xu, Jinhui 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

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

Cites Work

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

This page was built for publication: Map of Geometric Minimal Cuts for General Planar Embedding