Relating bends and size in orthogonal graph drawings

DOI10.1016/S0020-0190(97)00207-XzbMath1338.68210OpenAlexW2011874364MaRDI QIDQ293201

Therese C. Biedl

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S002001909700207X?np=y

zbMATH Keywords

algorithmslower boundscomputational geometryorthogonal graph drawing

Mathematics Subject Classification ID

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

Related Items (2)

Sliding column model for t-unit bar visibility representations of graphs ⋮ Embedding-preserving rectangle visibility representations of nonplanar graphs

Cites Work

• Area-efficient static and incremental graph drawings
• Algorithms for drawing graphs: An annotated bibliography
• A better heuristic for orthogonal graph drawings
• Drawing planar graphs using the canonical ordering
• An experimental comparison of four graph drawing algorithms.
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Optimal orthogonal drawings of triconnected plane graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Relating bends and size in orthogonal graph drawings