ACM Home Page
Please provide us with feedback. Feedback
Tree visualization with tree-maps: 2-d space-filling approach
Full text PdfPdf (4.57 MB)
Source ACM Transactions on Graphics (TOG) archive
Volume 11 ,  Issue 1  (January 1992) table of contents
Pages: 92 - 99  
Year of Publication: 1992
ISSN:0730-0301
Author
Ben Shneiderman  Univ. of Maryland, College Park
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 56,   Downloads (12 Months): 372,   Citation Count: 139
Additional Information:

references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/102377.115768
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
3
 
4
NAGV, G., AND SETn, S. Hierarchical representation of optically scanned documents. In Proceedings of the IEEE 7th International Conference on Pattern Recognition (Montreal, Canada, 1984), pp. 347-349.
 
5
SAM~:T, H. Design and Analysis of Spatial Data Structures. Addison-Wesley Publishing Co., Reading, MA, 1989.

CITED BY  139


REVIEW

"A. R. Forrest : Reviewer"

Conventional methods for representing tree structures graphically emphasize the structure of nodes and edges rather than attributes such as node size. Shneiderman presents an algorithm for visualizing graphs as space-filling diagrams, with eac  more...