Tree Visualization with Tree-Maps: 2-d Space-Filling Approach

ACM Transactions on Graphics (TOG)

Volumn 11, Issue 1, 1992, Pages 92-99

  Shneiderman, Ben ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976715951     PISSN: 07300301     EISSN: 15577368     Source Type: Journal    
DOI: 10.1145/102377.115768     Document Type: Article

References (5)

1. BENTLEY, J. L., AND FRIEDMAN, J. H. Data structures for range searching. ACM Comput. Surv. 11, 4 (Dec. 1979), 397-409.
2. KNUTH, D. E. The Art of Computer Programming: Volume 1 / Fundamental Algorithms. Addision-Wesley Publishing Co., Reading, MA, 1968.
3. LOMET, D. B., AND SALZBERG, B. The hB-tree: A multiattribute indexing method with good guaranteed performance. ACM Trans. Database Syst. 15, 4 (Dec. 1990), 625-658.
4. NAGY, G., AND SETH, 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. SAMET, H. Design and Analysis of Spatial Data Structures. Addison-Wesley Publishing Co., Reading, MA, 1989.