Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way

DOI10.7155/jgaa.00099zbMath1086.05022OpenAlexW2978625545MaRDI QIDQ3378507

Jeremy Yu Meng, David Eppstein, Michael T. Goodrich, Matthew T. Dickerson

Publication date: 3 April 2006

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/52298

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (17)

Edge routing with ordered bundles ⋮ On Strict (Outer-)Confluent Graphs ⋮ Overloaded Orthogonal Drawings ⋮ Planar and Poly-arc Lombardi Drawings ⋮ Force-Directed Lombardi-Style Graph Drawing ⋮ Approximating the Bundled Crossing Number ⋮ \(st\)-orientations with few transitive edges ⋮ $st$-Orientations with Few Transitive Edges ⋮ The Bundled Crossing Number ⋮ Drawing trees with perfect angular resolution and polynomial area ⋮ On strict (outer-)confluent graphs ⋮ Planar bus graphs ⋮ Confluent Hasse Diagrams ⋮ Crossing Layout in Non-planar Graph Drawings ⋮ Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets ⋮ Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs ⋮ Fan-planarity: properties and complexity

This page was built for publication: Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way