Edge routing with ordered bundles

DOI10.1016/j.comgeo.2015.10.005zbMath1356.68162OpenAlexW4206726148MaRDI QIDQ283873

Alexander E. Holroyd, Sergey Bereg, Sergey Pupyrev, Lev Nachmanson

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

graph drawingcrossing minimizationedge bundlingedge routing

Mathematics Subject Classification ID

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

Related Items

Approximating the Bundled Crossing Number, The Bundled Crossing Number, Bundled crossings revisited, Bundled Crossings Revisited, An algorithmic framework for labeling network maps, Supercharging plant configurations using Z3

Cites Work

• Unnamed Item
• The visibility-Voronoi complex and its applications
• Confluent layered drawings
• On the complexity of the disjoint paths problem
• Ordering Metro Lines by Block Crossings
• Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases
• Drawing Permutations with Few Corners
• Edge Routing with Ordered Bundles
• Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
• Fast Edge-Routing for Large Graphs
• An Improved Algorithm for the Metro-line Crossing Minimization Problem
• Improved Circular Layouts
• Integrating Edge Routing into Force-Directed Layout
• Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps
• Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• On the Usability of Lombardi Graph Drawings
• Drawing Metro Maps Using Bézier Curves
• Line Crossing Minimization on Metro Maps
• Drawing Graphs with GLEE