Area-efficient static and incremental graph drawings

DOI10.1007/3-540-63397-9_4zbMath1477.68201OpenAlexW1809204768MaRDI QIDQ826069

Michael Kaufmann, Therese C. Biedl

Publication date: 20 December 2021

Full work available at URL: https://doi.org/10.1007/3-540-63397-9_4

zbMATH Keywords

planar graphfree edgeincoming edgeoutgoing edgestatic scenario

Mathematics Subject Classification ID

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

Related Items (14)

Relating bends and size in orthogonal graph drawings ⋮ Algorithms and Bounds for L-Drawings of Directed Graphs ⋮ Optimal-area visibility representations of outer-1-plane graphs ⋮ Graph Compact Orthogonal Layout Algorithm ⋮ Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ Bend-optimal orthogonal graph drawing in the general position model ⋮ Orthogonal drawings based on the stratification of planar graphs ⋮ Bounded degree acyclic decompositions of digraphs. ⋮ Square-Orthogonal Drawing with Few Bends per Edge ⋮ The DFS-heuristic for orthogonal graph drawing ⋮ Balanced vertex-orderings of graphs ⋮ Non-planar square-orthogonal drawing with few-bend edges ⋮ On the Complexity of Some Geometric Problems With Fixed Parameters ⋮ On minimum- and maximum-weight minimum spanning trees with neighborhoods

This page was built for publication: Area-efficient static and incremental graph drawings