Edge routing with ordered bundles
From MaRDI portal
Publication:283873
DOI10.1016/J.COMGEO.2015.10.005zbMATH Open1356.68162OpenAlexW4206726148MaRDI QIDQ283873FDOQ283873
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- The visibility-Voronoi complex and its applications
- 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
- Confluent layered drawings
Cited In (15)
- StreamEB: stream edge bundling
- Edge-orders
- Supercharging plant configurations using Z3
- The Bundled Crossing Number
- Edge routing with ordered bundles
- Peacock bundles: bundle coloring for graphs with globality-locality trade-off
- An algorithmic framework for labeling network maps
- A simple pipeline for orthogonal graph drawing
- Bundled crossings revisited
- TGI-EB: a new framework for edge bundling integrating topology, geometry and importance
- Stub bundling and confluent spirals for geographic networks
- Approximating the Bundled Crossing Number
- MLSEB: edge bundling using moving least squares approximation
- Improving layered graph layouts with edge bundling
- Bundled crossings revisited
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)
