Exploring large graphs in 3D hyperbolic space
Exploring large graphs in 3D hyperbolic space
复制标题
DOI：
10.1109/38.689657
复制
发表时间：
1998-07-01
影响因子：
1.8
通讯作者：
Munzner, T
中科院分区：
文献类型：
--
作者：
Munzner, T
将图形绘制成由链接连接的节点在视觉上很吸引人，但在计算上很困难。双曲空间和生成树可以减少视觉混乱，加快布局，并提供流畅的交互。本文简要描述了一个软件系统，它明确地试图处理比以前的系统大得多的图形，并支持动态探索而不是最终呈现。然后，它讨论了这个系统的适用性，超越简单的探索目标。支持图形探索的软件系统应该包括布局和交互式绘图组件。我开发了新的布局和绘图算法（H3和H3Viewer）。H3Viewer绘图算法仍在开发中，因此本文介绍了初步结果。我已经实现了一个使用这些算法的软件库。它可以通过使用生成树作为布局和绘制算法的主干来处理超过100，000条边的图形。
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.