Distributed force-directed graph layout and visualization

Authors:
Christopher Mueller;Douglas Gregor;Andrew Lumsdaine
Affiliations:
Open Systems Laboratory, Indiana University, Bloomington, IN;Open Systems Laboratory, Indiana University, Bloomington, IN;Open Systems Laboratory, Indiana University, Bloomington, IN
Venue:
EG PGV'06 Proceedings of the 6th Eurographics conference on Parallel Graphics and Visualization
Year:
2006

Citing 4
Cited 2

Graph drawing by force-directed placement

Software—Practice & Experience
Large networks present visualization challenges

ACM SIGGRAPH Computer Graphics
Chromium: a stream-processing framework for interactive rendering on clusters

Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Graph Drawing Software

Graph Drawing Software

A scalable parallel force-directed graph layout algorithm

EG PGV'08 Proceedings of the 8th Eurographics conference on Parallel Graphics and Visualization
HD-GraphViz: highly distributed graph visualization on tiled displays

Proceedings of the Eighth Indian Conference on Computer Vision, Graphics and Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

While there exist many interactive tools for the visualization of small graphs and networks, these tools do not address the fundamental problems associated with the visualization of large graphs. In particular, larger graphs require much larger display areas (e.g., display walls) to reduce visual clutter, allowing users to determine the structure of large graphs. Moreover, the layout algorithms employed by these graph visualization tools do not scale to larger graphs, thereby forcing users into a batchoriented process of generating layouts offline and later viewing of static graph images. In this paper, we present a parallel graph layout algorithm based on the Fruchterman-Reingold force-directed layout algorithm and demonstrate its implementation in a distributed rendering environment. The algorithm uses available distributed resources for both compute and rendering tasks, animating the graph as the layout evolves. We evaluate the algorithm for scalability and interactivity and discuss variations that minimize communication for specific types of graphs and applications.