Relating bends and size in orthogonal graph drawings

DOI10.1016/S0020-0190(97)00207-XMaRDI QIDQ293201zbMATHOpenAlexFDO

Authors Therese 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

algorithmscomputational geometrylower boundsorthogonal graph drawing

Mathematics Subject Classification ID

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

Recommendations

• Orthogonal drawing of high degree graphs with small area and few bends
• Algorithms and Computation
• Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
• Orthogonal graph drawing with flexibility constraints
• Orthogonal graph drawing with flexibility constraints
• Orthogonal graph drawing with inflexible edges
• Orthogonal graph drawing with inflexible edges
• scientific article; zbMATH DE number 1693471
• Bend-optimal orthogonal graph drawing in the general position model
• scientific article; zbMATH DE number 2084292

Cites work

• scientific article; zbMATH DE number 49142 (Why is no real title available?)
• scientific article; zbMATH DE number 139786 (Why is no real title available?)
• A better heuristic for orthogonal graph drawings
• Algorithms for drawing graphs: An annotated bibliography
• An experimental comparison of four graph drawing algorithms.
• Area-efficient static and incremental graph drawings
• Drawing planar graphs using the canonical ordering
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Optimal orthogonal drawings of triconnected plane graphs

Cited in

(4)

• Slanted orthogonal drawings
• Embedding-preserving rectangle visibility representations of nonplanar graphs
• Sliding column model for t-unit bar visibility representations of graphs
• On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293201)