Optimal Orthogonal Graph Drawing with Convex Bend Costs

DOI10.1145/2838736zbMath1445.68151arXiv1204.4997OpenAlexW2110635609MaRDI QIDQ4962610

Thomas Bläsius, Dorothea Wagner, Ignaz Rutter

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.4997

zbMATH Keywords

efficient algorithmplanar embeddingorthogonal graph drawing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (10)

Orthogonal layout with optimal face complexity ⋮ Extending Partial Orthogonal Drawings ⋮ A topology-shape-metrics framework for ortho-radial graph drawing ⋮ An SPQR-tree-like embedding representation for upward planarity ⋮ Unnamed Item ⋮ Bend-minimum orthogonal drawings in quadratic time ⋮ Level-planar drawings with few slopes ⋮ Approximation Algorithms for Facial Cycles in Planar Embeddings ⋮ An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings ⋮ Extending Partial Orthogonal Drawings

This page was built for publication: Optimal Orthogonal Graph Drawing with Convex Bend Costs