Integrating Edge Routing into Force-Directed Layout

DOI10.1007/978-3-540-70904-6_3zbMath1185.68471OpenAlexW1601047321MaRDI QIDQ3595476

Michael Wybrow, Tim Dwyer, Kim Marriott

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

edge routingconstrained optimisationgraph layoutforce-directed layout

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Edge routing with ordered bundles ⋮ Peacock Bundles: Bundle Coloring for Graphs with Globality-Locality Trade-Off ⋮ A fast successive over-relaxation algorithm for force-directed network graph drawing ⋮ Topology Preserving Constrained Graph Layout ⋮ Constrained Stress Majorization Using Diagonally Scaled Gradient Projection

Uses Software

• IPSep-CoLa

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