Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Engineering
Distributed Edge Bundling For Large Graphs, Yves Tuyishime
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 …
Deploying, Improving And Evaluating Edge Bundling Methods For Visualizing Large Graphs, Jieting Wu
Deploying, Improving And Evaluating Edge Bundling Methods For Visualizing Large Graphs, Jieting Wu
Department of Computer Science and Engineering: Dissertations, Theses, and Student Research
A tremendous increase in the scale of graphs has been witnessed in a wide range of fields, which demands efficient and effective visualization techniques to assist users in better understandings of large graphs. Conventional node-link diagrams are often used to visualize graphs, whereas excessive edge crossings can easily incur severe visual clutter in the node-link diagram of a large graph. Edge bundling can effectively remedy visual clutter and reveal high-level graph structures. Although significant efforts have been devoted to developing edge bundling, three challenging problems remain. First, edge bundling techniques are often computationally expensive and are not easy to deploy …