|
 |
|
March 2003, Volume 2, Number 1, Pages 31-39
|
|
|
|
|
Table of contents Previous Full text Next PDF
|
|
|
|
| Original Article |
|
| Beamtrees: compact visualization of large hierarchies |
|
| Frank van Ham1 and Jarke J van Wijk1 |
|
1Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands
|
Correspondence to: Frank van Ham, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. Tel: +31 40 247 4579/5010; Fax: +31 40 246 8508; E-mail: fvham@win.tue.nl |
|
|
| Abstract |
|
Beamtrees are a new method for the visualization of large hierarchical data sets, such as directory structures and organization structures. Nodes are shown as stacked circular beams such that both the hierarchical structure as well as the size of nodes are depicted. The dimensions of beams are calculated using a variation of the treemap algorithm. Both a two-dimensional and a three-dimensional variant are presented. A small user study indicated that beamtrees are significantly more effective than nested treemaps and cushion treemaps for the extraction of global hierarchical information.
Information Visualization (2003) 2, 31-39. doi:10.1057/palgrave.ivs.9500036 |
|
| Keywords |
|
Information visualization; tree visualization; treemaps |
| Received 25 November 2002; revised 2 December 2002; accepted 4 December 2002 |
|
|
Table of contents Previous Full text Next PDF
|
|
|
|
