资 源 简 介
Graphs depicted as node-link diagrams are widely used to show relationships between entities. Although node-link diagrams provide an intuitive way to represent graphs, visual clutter quickly becomes a problem when graphs comprised of a large number of nodes and edges are visualized.
Force-Directed Edge Bundling(FDEB) is an edge bundling method to reduce visual clutter for Graph Visualization, that uses a self-organizing approach to bundling in which edges are modeled as flexible springs that can attract each other.
One crucial problem of FDEB is the high Time Complexity, so I implement a parallel FDEB using cuda, and gain a 10x speedup compared with the C version.
This work based on Danny Holten and Jarke J. van Wijk"s paper "Force-Directed Edge Bundling for Graph Visualization".
