Relating bends and size in orthogonal graph drawings
From MaRDI portal
Publication:293201
DOI10.1016/S0020-0190(97)00207-XzbMATH Open1338.68210OpenAlexW2011874364MaRDI QIDQ293201FDOQ293201
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
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
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal orthogonal drawings of triconnected plane graphs
- Area-efficient static and incremental graph drawings
Cited In (2)
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)
