Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings

DOI10.1007/978-3-642-25878-7_35zbMath1311.68103OpenAlexW1429667830MaRDI QIDQ3223969

David Eppstein, Michael J. Bannister

Publication date: 9 March 2012

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25878-7_35

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Turn-regularity and optimal area drawings of orthogonal representations
• THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING
• Complexity of Finding Non-Planar Rectilinear Drawings of Graphs
• On Rectilinear Drawing of Graphs
• The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• k-Degenerate Graphs
• On the complexity of orthogonal compaction

This page was built for publication: Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings