Exploring Large Graphs in 3D Hyperbolic Space

Exploring Large Graphs in 3D Hyperbolic Space,10.1109/38.689657,IEEE Computer Graphics and Applications,Tamara Munzner

Exploring Large Graphs in 3D Hyperbolic Space   (Citations: 112)
BibTex | RIS | RefWorks Download
Drawing graphs as nodes connected by links is visually compelling but computationally difficult. Hyperbolic space and spanning trees can reduce visual clutter, speed up layout, and provide fluid interaction. This article briefly describes a software system that explicitly attempts to handle much larger graphs than previous systems and support dynamic exploration rather than final presentation. It then discusses the applicability of this system to goals beyond simple exploration. A software system that supports graph exploration should include both a layout and an interactive drawing component. I have developed new algorithms for both layout and drawing (H3 and H3Viewer). The H3Viewer drawing algorithm remains under development, so this article presents preliminary results. I have implemented a software library that uses these algorithms. It can handle graphs of more than 100,000 edges by using a spanning tree as the backbone for the layout and drawing algorithms
Journal: IEEE Computer Graphics and Applications - CGA , vol. 18, no. 4, pp. 18-23, 1998
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: