Overloaded Orthogonal Drawings
From MaRDI portal
Publication:3223958
DOI10.1007/978-3-642-25878-7_24zbMath1311.68120OpenAlexW192557723MaRDI QIDQ3223958
Evgenios M. Kornaropoulos, Ioannis. G. Tollis
Publication date: 9 March 2012
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25878-7_24
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (4)
Algorithms and Bounds for L-Drawings of Directed Graphs ⋮ Drawing Order Diagrams Through Two-Dimension Extension ⋮ Unnamed Item ⋮ Planar L-Drawings of Directed Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Confluent layered drawings
- Algorithms for computing a parameterized \(st\)-orientation
- Area requirement and symmetry display of planar upward drawings
- Computing an st-numbering
- Algorithms for area-efficient orthogonal drawing
- A better heuristic for orthogonal graph drawings
- Efficient orthogonal drawings of high degree graphs
- THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING
- Applications of Parameterized st-Orientations
- On minimal-node-cost planar embeddings
- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Orthogonal Drawings of Plane Graphs Without Bends
- Computing and Combinatorics
This page was built for publication: Overloaded Orthogonal Drawings
