Beamtrees: Compact Visualization of Large Hierarchies
2003 ◽
Vol 2
(1)
◽
pp. 31-39
◽
Keyword(s):
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.
2005 ◽
Vol 4
(1)
◽
pp. 1-21
◽
1986 ◽
Vol 32
(112)
◽
pp. 391-396
◽
Keyword(s):
1991 ◽
Vol 12
(1)
◽
pp. 11-16
◽
2019 ◽
Vol 2673
(4)
◽
pp. 811-822
◽
Keyword(s):
2017 ◽
Vol 88
(9)
◽
pp. 1026-1037
◽
1974 ◽
Vol 25
(5)
◽
pp. 803
◽
Keyword(s):
2015 ◽
Vol 22
(2)
◽
pp. 378-382
◽
Keyword(s):
2018 ◽
Vol 51
(4)
◽
pp. 982-989
◽