Integrating Edge Routing into Force-Directed Layout

DOI10.1007/978-3-540-70904-6_3MaRDI QIDQ3595476zbMATH OpenOpenAlexFDO

Authors Tim Dwyer, Kim Marriott, Michael Wybrow

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_3

zbMATH Keywords

constrained optimisationedge routingforce-directed layoutgraph layout

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)

Recommendations

• Constrained graph layout by stress majorization and gradient projection
• Fast edge-routing for large graphs
• scientific article; zbMATH DE number 2080097
• A multi-dimensional approach to force-directed layouts of large graphs
• Graph Drawing

Cited in

(6)

• Edge routing with ordered bundles
• Peacock bundles: bundle coloring for graphs with globality-locality trade-off
• Fast edge-routing for large graphs
• Topology Preserving Constrained Graph Layout
• A fast successive over-relaxation algorithm for force-directed network graph drawing
• Constrained Stress Majorization Using Diagonally Scaled Gradient Projection

Describes a project that uses

Uses Software

• IPSep-CoLa

This page was built for publication: Integrating Edge Routing into Force-Directed Layout

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