DMCA
Tree visualization with Tree-maps: A 2-d space-filling approach (1991)
| Venue: | ACM Transactions on Graphics |
| Citations: | 534 - 29 self |
BibTeX
@ARTICLE{Shneiderman91treevisualization,
author = {Ben Shneiderman},
title = {Tree visualization with Tree-maps: A 2-d space-filling approach},
journal = {ACM Transactions on Graphics},
year = {1991},
volume = {11},
pages = {92--99}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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 (Samet, 1989) and their variants which are important in image processing. The goal of quad trees is to provide a tree representation for storage compression and efficient operations on bit-mapped images. XY-trees (Nagy & Seth, 1984) are a traditional tree representation of two-dimensional layouts found in newspaper, magazine, or book pages. Related concepts include k-d trees (Bentley and Freidman, 1979), which are often explained with the help of a
Keyphrases
tree visualization 2-d space-filling approach 2-d image k-d tree nagy seth related concept traditional tree representation tree representation bit-mapped image storage compression space-filling approach tree structure link representation book page node size two-dimensional layout image processing efficient operation quad tree
