TREE VISUALIZATION WITH TREE-MAPS - 2-D SPACE-FILLING APPROACH
TREE VISUALIZATION WITH TREE-MAPS - 2-D SPACE-FILLING APPROACH
复制标题
DOI：
10.1145/102377.115768
复制
发表时间：
1992-01-01
影响因子：
6.2
通讯作者：
SHNEIDERMAN, B
中科院分区：
文献类型：
--
作者：
SHNEIDERMAN, B
导论.表示树结构的传统方法是将根节点表示为一个有向图，根节点位于页面顶部，子节点位于父节点之下，并用线连接它们（图1）。Knuth[21]对这种标准表示法进行了长时间的讨论，特别是为什么根在顶部，他提供了几种替代方法，包括简要提到空间填充方法。然而，他的演讲的其余部分和大多数其他关于树的讨论都集中在各种节点和边的表示上。与此相反，本文处理的二维（2-d）空间填充方法，其中每个节点是一个矩形，其面积与一些属性，如节点大小成正比。2-d图像之间的关系和它们的表示在树结构的研究集中在2-d图像的节点和链接表示。这项工作包括四叉树[51]及其变体，这些变体在图像处理中非常重要。四叉树的目标是为位图图像的存储压缩和高效操作提供一种树表示。XY-
Introduction. The traditional approach to representing tree structures is as a rooted, directed graph with the root node at the top of the page and children nodes below the parent node with lines connecting them (Figure 1). Knuth[21 has a long discussion about this standard representation, especially why the root is at the top, and he offers several alternatives including brief mention of a space-filling approach. However, the remainder of his presentation and most other discussions of trees focus on various node and edge representations. By contrast, this paper deals with a two-dimensional(2-d) space-filling approach in which each node is a rectangle whose area is proportional to some attribute such as node size.Research on relationships between 2-d images and their representation in tree structures has focussed on node and link representations of 2-d images. This work includes quad-trees[51 and their variants which are important in image processing. The goal of quad trees is to provide a tree representation for storage compression and efilcient operations on bit-mapped images. XY-