Cone Tree
[ROBE91a]
[ROBE91b]
[ROBE93]
[CARR95]
Description
For hierarchical data.
Bring any node to the front by clicking on it, which smoothly rotates the tree.
Advantages
Good for evenly-balanced trees.
Disadvantages
- Large 2D trees become too cluttered.
- currently limited to roughly 1000 nodes, 10 layers, branching factor of 30
[PEAR]
- large computational requirements [PEAR]
- incapable of displaying multiple hierarchical data structures [PEAR]
This page maintained by Mark Brautigam
(PDA version)
Last updated 1 March 1997