Edge Routing with Ordered Bundles

  title={Edge Routing with Ordered Bundles},
  author={Sergey Pupyrev and Lev Nachmanson and Sergey Bereg and Alexander E. Holroyd},
  booktitle={Graph Drawing},
We propose a new approach to edge bundling. The approach starts by routing the edge paths to minimize a weighted sum of the total length of the paths together with the ink required to draw them. As this problem is NP-hard, we provide an efficient heuristic that finds an approximate solution. Our approach continues by separating edges belonging to the same bundle. To achieve this, we provide a new and efficient algorithm that solves a variant of the metro-line crossing minimization problem. The… CONTINUE READING