Share Email Print

Proceedings Paper

OpenOrd: an open-source toolbox for large graph layout
Author(s): Shawn Martin; W. Michael Brown; Richard Klavans; Kevin W. Boyack
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

We document an open-source toolbox for drawing large-scale undirected graphs. This toolbox is based on a previously implemented closed-source algorithm known as VxOrd. Our toolbox, which we call OpenOrd, extends the capabilities of VxOrd to large graph layout by incorporating edge-cutting, a multi-level approach, average-link clustering, and a parallel implementation. At each level, vertices are grouped using force-directed layout and average-link clustering. The clustered vertices are then re-drawn and the process is repeated. When a suitable drawing of the coarsened graph is obtained, the algorithm is reversed to obtain a drawing of the original graph. This approach results in layouts of large graphs which incorporate both local and global structure. A detailed description of the algorithm is provided in this paper. Examples using datasets with over 600K nodes are given. Code is available at

Paper Details

Date Published: 24 January 2011
PDF: 11 pages
Proc. SPIE 7868, Visualization and Data Analysis 2011, 786806 (24 January 2011); doi: 10.1117/12.871402
Show Author Affiliations
Shawn Martin, Sandia National Labs. (United States)
W. Michael Brown, Sandia National Labs. (United States)
Richard Klavans, SciTech Strategies, Inc. (United States)
Kevin W. Boyack, SciTech Strategies, Inc. (United States)

Published in SPIE Proceedings Vol. 7868:
Visualization and Data Analysis 2011
Pak Chung Wong; Jinah Park; Ming C. Hao; Chaomei Chen; Katy Börner; David L. Kao; Jonathan C. Roberts, Editor(s)

© SPIE. Terms of Use
Back to Top