Reconstructing sets of orthogonal line segments in the plane

DOI10.1016/0012-365X(93)90124-CzbMath0785.68091MaRDI QIDQ688265

Franz Rendl, Gerhard J. Woeginger

Publication date: 7 February 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

computational geometryorthogonal line segments

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Configurations with few crossings in topological graphs ⋮ Winner determination in geometrical combinatorial auctions ⋮ Matching points with rectangles and squares ⋮ A Bottleneck Matching Problem with Edge-Crossing Constraints ⋮ The complexity of detecting crossingfree configurations in the plane

Cites Work

• Rectilinear planar layouts and bipolar orientations of planar graphs
• Two-Processor Scheduling with Start-Times and Deadlines
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reconstructing sets of orthogonal line segments in the plane