Improved Circular Layouts

DOI10.1007/978-3-540-70904-6_37MaRDI QIDQ3595468zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• On circular layouts^∗
• A framework and algorithms for circular drawings of graphs
• Graph-Theoretic Concepts in Computer Science
• Circular graph drawings with large crossing angles
• More flexible radial layout

Cited in

(27)

• More flexible radial layout
• Multi-circular Layout of Micro/Macro Graphs
• Experimental evaluation of book drawing algorithms
• Group-Level Analysis and Visualization of Social Networks
• The Bundled Crossing Number
• Edge routing with ordered bundles
• Image-based graph visualization: advances and challenges
• Edge routing with ordered bundles
• Planar bus graphs
• scientific article; zbMATH DE number 7236457 (Why is no real title available?)
• A framework and algorithms for circular drawings of graphs
• Circular right-angle crossing drawings in linear time
• The Turing Test for Graph Drawing Algorithms
• Computing hive plots: a combinatorial framework
• Graph Drawing
• Treewidth, Circle Graphs, and Circular Drawings
• TGI-EB: a new framework for edge bundling integrating topology, geometry and importance
• Optimizing a radial layout of bipartite graphs for a tool visualizing security alerts
• Computing hive plots: a combinatorial framework
• MLSEB: edge bundling using moving least squares approximation
• Approximating the Bundled Crossing Number
• More flexible radial layout
• The parameterized complexity of extending stack layouts
• Crossing Layout in Non-planar Graph Drawings
• On circular layouts^∗
• Graph-Theoretic Concepts in Computer Science
• A force-directed algorithm for drawing directed graphs symmetrically

This page was built for publication: Improved Circular Layouts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595468)