Efficient orthogonal drawings of high degree graphs
From MaRDI portal
Publication:1969947
DOI10.1007/S004539910006zbMATH Open0951.68099OpenAlexW2049441051MaRDI QIDQ1969947FDOQ1969947
Authors: Achilleas Papakostas, Ioannis G. Tollis 
Publication date: 12 December 2000
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004539910006
Recommendations
Cited In (21)
- Drawing Graphs with Right Angle Crossings
- Right Angle Crossing Drawings of Graphs
- A Riemannian approach to graph embedding
- On the Hardness of Orthogonal-Order Preserving Graph Drawing
- Square-orthogonal drawing with few bends per edge
- Orthogonal drawing of high degree graphs with small area and few bends
- Title not available (Why is that?)
- Optimal three-dimensional orthogonal graph drawing in the general position model.
- New results on drawing angle graphs
- Algorithms and bounds for overloaded orthogonal drawings
- Drawing graphs with right angle crossings
- Title not available (Why is that?)
- Overloaded orthogonal drawings
- The DFS-heuristic for orthogonal graph drawing
- Non-planar square-orthogonal drawing with few-bend edges
- Area, curve complexity, and crossing resolution of non-planar graph drawings
- Algorithms for area-efficient orthogonal drawing
- The three-phase method: a unified approach to orthogonal graph drawing
- An experimental comparison of four graph drawing algorithms.
- Techniques for the Refinement of Orthogonal Graph Drawings
- Orthogonal Hypergraph Drawing for Improved Visibility
This page was built for publication: Efficient orthogonal drawings of high degree graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969947)
