Exploring large graphs in 3D hyperbolic space
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 18 (4) , 18-23
- https://doi.org/10.1109/38.689657
Abstract
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.Keywords
This publication has 9 references indexed in Scilit:
- H3: laying out large directed graphs in 3D hyperbolic spacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Extending distortion viewing from 2D to 3DIEEE Computer Graphics and Applications, 1997
- Visualizing the structure of the World Wide Web in 3D hyperbolic spacePublished by Association for Computing Machinery (ACM) ,1995
- A focus+context technique based on hyperbolic geometry for visualizing large hierarchiesPublished by Association for Computing Machinery (ACM) ,1995
- Algorithms for drawing graphs: an annotated bibliographyComputational Geometry, 1994
- Visualizing hyperbolic spacePublished by Association for Computing Machinery (ACM) ,1992
- Cone TreesPublished by Association for Computing Machinery (ACM) ,1991
- Nice drawings of graphs are computationally hardPublished by Springer Nature ,1990
- Sphere Packings, Lattices and GroupsPublished by Springer Nature ,1988