TreeJuxtaposer:: Scalable tree comparison using Focus+Context with guaranteed visibility

TreeJuxtaposer:: Scalable tree comparison using Focus+Context with guaranteed visibility
复制标题

DOI:
10.1145/882262.882291
复制
发表时间:
2003-07-01
影响因子:
6.2
通讯作者:
Zhou, YH
Zhou, YH
中科院分区:
计算机科学1区
文献类型:
--
作者:
Munzner, T;Guimbretière, F;Zhou, YH

文献摘要

被引文献

相似文献

大型树木的结构比较是一项困难的任务,目前的可视化技术仅部分支持,主要是为浏览而设计的。我们提出了TreeJuxtaposer,一个系统,旨在支持几十万个节点的大树的比较任务。我们引入了“保证可见性”的概念。其中突出显示的区域被视为必须始终保持视觉上明显的界标。我们提出了一种新的方法,详细的结构比较两棵树,并提供了一个新的近似线性算法计算最佳对应节点从一棵树到另一个。此外,我们提出了一种新的直线焦点+上下文导航技术,非常适合动态链接的并排视图,同时保证地标的可见性和恒定的帧速率。这三个贡献导致系统提供流体探索体验,该体验在数据集的大小和显示器中的像素数量上都是可缩放的。我们的系统的设计决策是基于生物学家的目标受众的需求,他们必须了解许多系统发育或进化的结构细节。树我们的工具在许多其他需要树比较的应用领域也很有用,从网络管理到调用图优化再到家谱。
Structural comparison of large trees is a difficult task that is only partially Supported by current visualization techniques, which are mainly designed for browsing. We present TreeJuxtaposer, a system designed to support the comparison task for large trees of several hundred thousand nodes. We introduce the idea of "guaranteed visibility". where highlighted areas are treated as landmarks that must remain visually apparent at all times. We propose a new methodology for detailed structural comparison between two trees and provide a new nearly-linear algorithm for computing the best corresponding node from one tree to another. In addition, we present a new rectilinear Focus+Context technique for navigation that is well suited to the dynamic linking of side-by-side views while guaranteeing landmark visibility and constant frame rates. These three contributions result in a system delivering a fluid exploration experience that scales both in the size of the dataset and the number of pixels in the display. We have based the design decisions for our system on the needs of a target audience of biologists who must understand the structural details of many phylogenetic, or evolutionary. trees. Our tool is also useful in many other application domains where tree comparison is needed, ranging from network management to call graph optimization to genealogy.