Engineering Commons^™

Distributed Edge Bundling For Large Graphs, Yves Tuyishime

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Graphs or networks are widely used to depict the relationships between data entities in diverse scientific and engineering applications. A direct visualization (such as node-link diagram) of a graph with a large number of nodes and edges often incurs visual clutter. To address this issue, researchers have developed edge bundling algorithms that visually merge similar edges into curved bundles and can effectively reveal high-level edge patterns with reduced visual clutter. Although the existing edge bundling algorithms achieve appealing results, they are mostly designed for a single machine, and thereby the size of a graph they can handle is limited by …