Treemap 3.2 Documentation

Treemap

Treemaps are a space-filling visualization for hierarchical structures that are extremely effective in showing attributes of leaf nodes by size and color coding. Treemaps enable users to compare sizes of nodes and of sub-trees, and are especially strong in spotting unusual patterns.

Treemap 3.2 implements three Treemap algorithms:

  • Slice And Dice - Ordered, very bad aspect ratios, stable
  • Squarified - Unordered, best aspect ratios, medium stability
  • Strip - Ordered, medium aspect ratios, medium stability

For more information:

Treemap 3: http://www.cs.umd.edu/hcil/treemap3

Treemap History: http://www.cs.umd.edu/hcil/treemaps

[Previous]   [Table of Contents]   [Next]

Web Accessibility