Improved Circular Layouts
From MaRDI portal
Publication:3595468
DOI10.1007/978-3-540-70904-6_37zbMath1185.68479OpenAlexW1577253155MaRDI QIDQ3595468
Emden R. Gansner, Yehuda Koren
Publication date: 28 August 2007
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70904-6_37
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (18)
Edge routing with ordered bundles ⋮ Circular right-angle crossing drawings in linear time ⋮ TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance ⋮ Edge Routing with Ordered Bundles ⋮ Optimizing a Radial Layout of Bipartite Graphs for a Tool Visualizing Security Alerts ⋮ Approximating the Bundled Crossing Number ⋮ The Bundled Crossing Number ⋮ Treewidth, Circle Graphs, and Circular Drawings ⋮ A force-directed algorithm for drawing directed graphs symmetrically ⋮ Experimental Evaluation of Book Drawing Algorithms ⋮ MLSEB: Edge Bundling Using Moving Least Squares Approximation ⋮ Image-based graph visualization: advances and challenges ⋮ Planar bus graphs ⋮ Multi-circular Layout of Micro/Macro Graphs ⋮ Unnamed Item ⋮ Group-Level Analysis and Visualization of Social Networks ⋮ Crossing Layout in Non-planar Graph Drawings ⋮ The Turing Test for Graph Drawing Algorithms
This page was built for publication: Improved Circular Layouts
