Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)
DOI10.1007/3-540-57155-8_244zbMATH Open1504.68161OpenAlexW1536741012MaRDI QIDQ5060109FDOQ5060109
Authors: Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu 
Publication date: 18 January 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-57155-8_244
Recommendations
- Spirality and Optimal Orthogonal Drawings
- Graph Drawing
- On the two-dimensional orthogonal drawing of series-parallel graphs
- Algorithms and Computation
- Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
- On orthogonally convex drawings of plane graphs (extended abstract)
- Optimal orthogonal drawings of triconnected plane graphs
- Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time
- Computing and Combinatorics
- Graph Drawing
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
Cited In (7)
- Rectilinear Planarity of Partial 2-Trees
- On turn-regular orthogonal representations
- Computing orthogonal drawings with the minimum number of bends
- On-line convex planarity testing
- Algorithms for area-efficient orthogonal drawing
- Algorithms and Computation
- An efficient orthogonal grid drawing algorithm for cubic graphs
This page was built for publication: Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060109)
