[an error occurred while processing this directive]
Drawing Large Graphs with H3Viewer and Site Manager
Drawing Large Graphs with H3Viewer and Site Manager
Tamara Munzner
Lecture Notes in Computer Science series, Proceedings for the
Symposium on Graph Drawing, GD
'98, Montreal, Canada, August 1998, to appear.
Abstract
We demonstrate the H3Viewer graph drawing library, which can be
run from a standalone program or in conjunction with other programs
such as SGI's Site Manager application. Our layout and drawing
algorithms support interactive navigation of large graphs up to
100,000 edges. We present an adaptive drawing algorithm with a
guaranteed frame rate. Both layout and navigation occur in 3D
hyperbolic space, which provides a view of a large neighborhood around
an easily changeable point of interest. We find an appropriate
spanning tree to use as the backbone for fast layout and uncluttered
drawing, and non-tree links can be displayed on demand. Our
methods are appropriate when node or link annotations can guide the
choice of a good parent from among all of the incoming links. Such
annotations can be constructed using only a small amount of
domain-specific knowledge, thus rendering tractable many graphs which
may seem rather densely connected at first glance.
Additional information
- Site Manager
- An implementation of the system described in the paper is
included in this free web publishing package from SGI.
- H3/H3Viewer libraries
- available for free noncommercial use
- H3 Video
- downloadable
Versions of the paper:
- PostScript version, greyscale figures
(7.3 MB uncompressed, .6 MB gzipped).
- PDF (300K)
- (HTML version will be made available after the Springer proceedings are
out)
Related papers:
Figures
-
Figure 1: Site Manager shows the
hyperlink structure of the Stanford Graphics Group Web site drawn as a
graph in 3D hyperbolic space next to the directory structure of the
site drawn with a traditional browser. The entire site has over 14,000
nodes and 29,000 edges, of which only some in the neighborhood of a
course homepage are drawn in this snapshot. In addition to the main
spanning tree, we draw the non-tree outgoing links from a subtree
corresponding to the first day's lecture. The tree is oriented so that
ancestors of the course page appear on the left and its descendants
grow to the right.
-
Figure 2: A function call graph of a small FORTRAN benchmark with
1000 nodes and 4000 edges. Above a single frame has been drawn in
1/20th of a second, while below the entire graph is drawn after the
user has stopped moving the mouse. Non-tree links from one of the
functions are drawn.
High Resolution TIFF Color Figures:
1,
2a,
2b
Please request permission
before reprinting figures.
Copyright 1998 Springer-Verlag
Springer LNCS series
Last modified: Fri Jun 8 15:36:41 PDT 2001
[email protected]
