Document Open Access Logo

Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings

Authors Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf

Thumbnail PDF


  • Filesize: 1.64 MB
  • 16 pages

Document Identifiers

Author Details

Lukas Barth
Benjamin Niedermann
Ignaz Rutter
Matthias Wolf

Cite AsGet BibTex

Lukas Barth, Benjamin Niedermann, Ignaz Rutter, and Matthias Wolf. Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings. In 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 77, pp. 14:1-14:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)


Ortho-Radial drawings are a generalization of orthogonal drawings to grids that are formed by concentric circles and straight-line spokes emanating from the circles' center. Such drawings have applications in schematic graph layouts, e.g., for metro maps and destination maps. A plane graph is a planar graph with a fixed planar embedding. We give a combinatorial characterization of the plane graphs that admit a planar ortho-radial drawing without bends. Previously, such a characterization was only known for paths, cycles, and theta graphs, and in the special case of rectangular drawings for cubic graphs, where the contour of each face is required to be a rectangle. The characterization is expressed in terms of an ortho-radial representation that, similar to Tamassia's orthogonal representations for orthogonal drawings describes such a drawing combinatorially in terms of angles around vertices and bends on the edges. In this sense our characterization can be seen as a first step towards generalizing the Topology-Shape-Metrics framework of Tamassia to ortho-radial drawings.
  • Graph Drawing
  • Ortho-Radial Drawings
  • Combinatorial Characterization
  • Bend Minimization
  • Topology-Shape-Metrics


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Lukas Barth, Benjamin Niedermann, Ignaz Rutter, and Matthias Wolf. Towards a topology-shape-metrics framework for ortho-radial drawings. CoRR, arXiv:1703.06040, 2017. Google Scholar
  2. Therese Biedl and Goos Kant. A better heuristic for orthogonal graph drawings. Computational Geometry: Theory and Applications, 9:159-180, 1998. Google Scholar
  3. Thomas Bläsius, Marcus Krug, Ignaz Rutter, and Dorothea Wagner. Orthogonal graph drawing with flexibility constraints. Algorithmica, 68(4):859-885, 2014. Google Scholar
  4. Thomas Bläsius, Sebastian Lehmann, and Ignaz Rutter. Orthogonal graph drawing with inflexible edges. Computational Geometry: Theory and Applications, 55:26-40, 2016. Google Scholar
  5. Thomas Bläsius, Ignaz Rutter, and Dorothea Wagner. Optimal orthogonal graph drawing with convex bend costs. ACM Transactions on Algorithms, 12:33:1-33:32, 2016. Google Scholar
  6. Sabine Cornelsen and Andreas Karrenbauer. Accelerated bend minimization. Journal of Graph Algorithms and Applications, 16(3):635-650, 2012. Google Scholar
  7. Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Graph Drawing - Algorithms for the Visualization of Graphs. Prentice Hall, 1999. Google Scholar
  8. Giuseppe Di Battista, Giuseppe Liotta, and Francesco Vargiu. Spirality and optimal orthogonal drawings. SIAM Journal on Computing, 27(6):1764-1811, 1998. URL:
  9. Christian A. Duncan and Michael T. Goodrich. Handbook of Graph Drawing and Visualization, chapter Planar Orthogonal and Polyline Drawing Algorithms, pages 223-246. CRC Press, 2013. Google Scholar
  10. Ashim Garg and Roberto Tamassia. On the computational complexity of upward and rectilinear planarity testing. SIAM Journal on Computing, 31(2):601-625, 2001. Google Scholar
  11. Madieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay, and Maryam Tahmasbi. Rectangular-radial drawings of cubic plane graphs. Computational Geometry: Theory and Applications, 43:767-780, 2010. Google Scholar
  12. Mahdie Hasheminezhad, S. Mehdi Hashemi, and Maryam Tahmabasi. Ortho-radial drawings of graphs. Australasian Journal of Combinatorics, 44:171-182, 2009. Google Scholar
  13. Md. Saidur Rahman, Shin-ichi Nakano, and Takao Nishizeki. Rectangular grid drawings of plane graphs. Computational Geometry: Theory and Applications, 10:203-220, 1998. Google Scholar
  14. Md. Saidur Rahman, Takao Nishizeki, and Mahmuda Naznin. Orthogonal drawings of plane graphs without bends. Journal of Graph Algorithms and Applications, 7(3):335-362, 2003. Google Scholar
  15. Roberto Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing, 16(3):421-444, 1987. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail