high performance computing on graphics processing units: hgpu.org

We present a fast and simple adaption of the well-known mean shift technique for image segmentation to compute bundled layouts of general graphs. For this, we first transform a given graph drawing into a density map using kernel density estimation. Next, we apply the equivalent of mean shift segmentation on this image, i.e. sharpen the image my moving the drawn edges upstream in the density’s gradient. We implement our method using standard graphics acceleration techniques. Our results are similar to state-of-the-art graph bundling methods but require a fraction of their cost. We demonstrate our method on several large graphs.