Minimising the number of bends and volume in 3-dimensional orthogonal graph drawings with a diagonal vertex layout

DOI10.1007/s00453-004-1091-4zbMath1094.68107OpenAlexW2038490205MaRDI QIDQ1889862

David R. Wood

Publication date: 13 December 2004

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-004-1091-4

zbMATH Keywords

book embeddingvertex-ordering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

Imbalance is fixed parameter tractable ⋮ Complexity results for three-dimensional orthogonal graph drawing ⋮ A note on 3D orthogonal graph drawing ⋮ Balanced vertex-orderings of graphs ⋮ Clean the graph before you draw it! ⋮ Imbalance parameterized by twin cover revisited

This page was built for publication: Minimising the number of bends and volume in 3-dimensional orthogonal graph drawings with a diagonal vertex layout