Approximating the Bundled Crossing Number

  title={Approximating the Bundled Crossing Number},
  author={Alan Arroyo and Stefan Felsner},
Bundling crossings is a strategy which can enhance the readability of drawings. In this paper we consider good drawings, i.e., we require that any two edges have at most one common point which can be a common vertex or a crossing. Our main result is that there is a polynomial time algorithm to compute an 8-approximation of the bundled crossing number of a good drawing (up to adding a term depending on the facial structure of the drawing). In the special case of circular drawings the… 


The Bundled Crossing Number
The bundled crossing number is shown to be closely related to the orientable genus of the graph, and the problem of minimizing the number of bundled crossings is investigated.
Bundled Crossings Revisited
This work considers the problem of bundled crossing minimization and shows that the problem is NP-hard when the authors require a simple drawing, and develops an FPT algorithm (in k) when the drawing requires a simple circular layout.
Bundled Crossings in Embedded Graphs
It is shown that the structure of two disjoint groups of locally parallel edges intersecting in a complete crossbar (a bundled crossing) is visually simpler—even if it involves many individual crossings—than an equal number of random crossings scattered in the plane.
Improved Circular Layouts
Three independent, complementary techniques for lowering the density and improving the readability of circular layouts are suggested, able to reduce clutter, density and crossings compared with existing methods.
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
This work introduces a new approach for drawing diagrams that allows groups of edges to be merged together and drawn as tracks (similar to train tracks), and offers two heuristic algorithms to test if a non-planar graph can be drawn efficiently in a confluent way.
Skeleton-Based Edge Bundling for Graph Visualization
A novel approach that combines edge clustering, distance fields, and 2D skeletonization to construct progressively bundled layouts for general graphs by iteratively attracting edges towards the centerlines of level sets of their distance fields.
Edge Routing with Ordered Bundles
On Strict (Outer-)Confluent Graphs
Several new relationships are established between the class of SC graphs and other graph classes, in particular string graphs and unit-interval graphs, and it is established that tree-like ($\Delta$-)SOC graphs have bounded cliquewidth.
Winding Roads: Routing edges into bundles
This paper introduces an intuitive edge bundling technique which efficiently reduces edge clutter in graphs drawings and a GPU‐based rendering method which helps users perceive bundles densities while preserving edge color.
Ordering Metro Lines by Block Crossings
This work gives approximation algorithms for special classes of graphs and an asymptotically worst-case optimal algorithm for block crossings on general graphs and suggests merging crossings into block crossings, that is, crossings of two neighboring groups of consecutive lines.