Smooth orthogonal layouts

DOI10.7155/JGAA.00305MaRDI QIDQ2856479zbMATH OpenOpenAlexFDO

Authors Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis

Publication date 29 October 2013

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

Kandinsky modelsmooth complexity-2 layout

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Smooth orthogonal layouts
• Smooth Orthogonal Drawings of Planar Graphs
• Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity

Cited in

(4)

• Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity
• On orthogonally convex drawings of plane graphs
• Smooth orthogonal layouts
• Crossing Layout in Non-planar Graph Drawings

This page was built for publication: Smooth orthogonal layouts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2856479)