Computing orthogonal drawings with the minimum number of bends

DOI10.1007/3-540-63307-3_72zbMath1497.68367OpenAlexW1799248239MaRDI QIDQ5096950

Giuseppe Di Battista, Paola Bertolazzi, Walter Didimo

Publication date: 19 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63307-3_72

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On the complexity of orthogonal compaction

Cites Work

• Unnamed Item
• Unnamed Item
• A unified approach to visibility representations of planar graphs
• Planar graphs: Theory and algorithms
• Algorithms for drawing graphs: An annotated bibliography
• A better heuristic for orthogonal graph drawings
• On-line maintenance of triconnected components with SPQR-trees
• An experimental comparison of four graph drawing algorithms.
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• Dividing a Graph into Triconnected Components
• Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)

This page was built for publication: Computing orthogonal drawings with the minimum number of bends