On the Total Number of Bends for Planar Octilinear Drawings

DOI10.7155/jgaa.00436zbMath1366.05074OpenAlexW2670604581MaRDI QIDQ5278054

Robert Bellarmine Krug, Michael Kaufmann, Michael A. Bekos

Publication date: 13 July 2017

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00436

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

Quasi-upward planar drawings with minimum curve complexity ⋮ Universal slope sets for 1-bend planar drawings ⋮ On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings ⋮ Universal slope sets for upward planar drawings

This page was built for publication: On the Total Number of Bends for Planar Octilinear Drawings