Edge routing with ordered bundles

DOI10.1016/J.COMGEO.2015.10.005MaRDI QIDQ283873zbMATHOpenAlexFDO

Authors Sergey Pupyrev, Lev Nachmanson, Sergey Bereg, A. E. Holroyd

Publication date 17 May 2016

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2015.10.005

zbMATH Keywords

crossing minimizationedge bundlingedge routinggraph drawing

Mathematics Subject Classification ID

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

Recommendations

• Edge routing with ordered bundles
• Stub bundling and confluent spirals for geographic networks
• Improving layered graph layouts with edge bundling
• Bundled crossings revisited
• MLSEB: edge bundling using moving least squares approximation

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An improved algorithm for the metro-line crossing minimization problem
• Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
• Confluent layered drawings
• Drawing Graphs with GLEE
• Drawing metro maps using Bézier curves
• Drawing permutations with few corners
• Edge routing with ordered bundles
• Fast edge-routing for large graphs
• Improved Circular Layouts
• Integrating Edge Routing into Force-Directed Layout
• Line Crossing Minimization on Metro Maps
• Metro-line crossing minimization: hardness, approximations, and tractable cases
• Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• On the complexity of the disjoint paths problem
• On the usability of Lombardi graph drawings
• Ordering Metro Lines by Block Crossings
• The visibility-Voronoi complex and its applications
• Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem

Cited in

(14)

• Stub bundling and confluent spirals for geographic networks
• Supercharging plant configurations using Z3
• Peacock bundles: bundle coloring for graphs with globality-locality trade-off
• Approximating the Bundled Crossing Number
• MLSEB: edge bundling using moving least squares approximation
• Edge routing with ordered bundles
• A simple pipeline for orthogonal graph drawing
• Improving layered graph layouts with edge bundling
• Bundled crossings revisited
• The Bundled Crossing Number
• Bundled crossings revisited
• TGI-EB: a new framework for edge bundling integrating topology, geometry and importance
• StreamEB: stream edge bundling
• Edge-orders

This page was built for publication: Edge routing with ordered bundles

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