Bend-optimal orthogonal drawings of triconnected plane graphs
From MaRDI portal
Publication:1713568
DOI10.1016/j.akcej.2017.08.001zbMath1403.05103OpenAlexW2754570984MaRDI QIDQ1713568
Kunal Lad, Rajiv Kumar, Siddharth Bhatia
Publication date: 25 January 2019
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2017.08.001
Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (1)
Cites Work
- Unnamed Item
- Lower bounds for planar orthogonal drawings of graphs
- Algorithms for drawing graphs: An annotated bibliography
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Spirality and Optimal Orthogonal Drawings
- A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
- Bounds For Orthogonal 3-D Graph Drawing
- Computing orthogonal drawings with the minimum number of bends
- Accelerated Bend Minimization
This page was built for publication: Bend-optimal orthogonal drawings of triconnected plane graphs