摘要: 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, provide fluid interaction. This article briefly describes a software system that explicitly attempts to handle much larger than previous systems support dynamic exploration rather final presentation. It then discusses the applicability of this goals beyond simple exploration. A supports graph should include both layout an interactive drawing component. I have developed new algorithms for (H3 H3Viewer). The H3Viewer algorithm remains under development, so presents preliminary results. implemented library uses these algorithms. more 100,000 edges using tree backbone