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 f...
Viewing a large graph in limited display space has traditionally been accomplished using either redu...
Abstract—We describe ASK-GraphView, a node-link-based graph visualization system that allows cluster...
We present a novel hierarchical force-directed method for drawing large graphs. The algorithm produc...
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in ...
Directed and undirected graphs provide a natural notation for describing many fundamental structures...
We present a 3-D version of GEM [6],a randomized adaptive layout algorithm for nicely drawing undire...
This paper proposes a new technique for visualizing large graphs of several ten thousands of vertice...
The growing studies show that the human brain can comprehend increasingly complex structures if they...
This thesis concentrates on drawing graphs in 3D. In the first part of the text, we concentrate on o...
Viewing a large graph in limited display space has traditionally been accomplished using either redu...
Data in real-world graph drawing applications often change frequently but incrementally. Any drastic...
We describe ASK-GraphView, a node-link-based graph visualization system that allows clustering and i...
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straig...
Data in real-world graph drawing applications often change frequently but incrementally. Any drastic...
Data in real-world graph drawing applications often change frequently but incrementally. Any drastic...
Viewing a large graph in limited display space has traditionally been accomplished using either redu...
Abstract—We describe ASK-GraphView, a node-link-based graph visualization system that allows cluster...
We present a novel hierarchical force-directed method for drawing large graphs. The algorithm produc...
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in ...
Directed and undirected graphs provide a natural notation for describing many fundamental structures...
We present a 3-D version of GEM [6],a randomized adaptive layout algorithm for nicely drawing undire...
This paper proposes a new technique for visualizing large graphs of several ten thousands of vertice...
The growing studies show that the human brain can comprehend increasingly complex structures if they...
This thesis concentrates on drawing graphs in 3D. In the first part of the text, we concentrate on o...
Viewing a large graph in limited display space has traditionally been accomplished using either redu...
Data in real-world graph drawing applications often change frequently but incrementally. Any drastic...
We describe ASK-GraphView, a node-link-based graph visualization system that allows clustering and i...
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straig...
Data in real-world graph drawing applications often change frequently but incrementally. Any drastic...
Data in real-world graph drawing applications often change frequently but incrementally. Any drastic...
Viewing a large graph in limited display space has traditionally been accomplished using either redu...
Abstract—We describe ASK-GraphView, a node-link-based graph visualization system that allows cluster...
We present a novel hierarchical force-directed method for drawing large graphs. The algorithm produc...