Computing orthogonal drawings with the minimum number of bends
From MaRDI portal
Publication:4571369
DOI10.1109/12.868028zbMath1392.68425OpenAlexW2097248064MaRDI QIDQ4571369
Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo
Publication date: 9 July 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/fbfb0e1e58148762d8670eb5866c61333ed3dfa7
Related Items (13)
HV-planarity: algorithms and complexity ⋮ Topological morphing of planar graphs ⋮ Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario ⋮ \(st\)-orientations with few transitive edges ⋮ $st$-Orientations with Few Transitive Edges ⋮ A topology-shape-metrics framework for ortho-radial graph drawing ⋮ An annotated review on graph drawing and its applications ⋮ Bend-optimal orthogonal drawings of triconnected plane graphs ⋮ On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings ⋮ Square-Orthogonal Drawing with Few Bends per Edge ⋮ On embedding a graph in the grid with the maximum number of bends and other bad features ⋮ Ortho-polygon visibility representations of embedded graphs ⋮ Topological Morphing of Planar Graphs
This page was built for publication: Computing orthogonal drawings with the minimum number of bends
