Term information
algorithm used to" divide a rectangle into sub-rectangles of specified areas. Ideally, a treemap algorithm would create rectangles of aspect ratio close to one, would furthermore preserve some sense of the ordering in the input data, and would change to reflect changes in the underlying data. Unfortunately, these properties have an inverse relationship. As the aspect ratio is optimized, the order of placement becomes less predictable. As the order becomes more stable, the aspect ratio is degraded. To date, five primary rectangular treemap algorithms have been developed: Treemap algorithms[1] algorithm order aspect ratios stability BinaryTree partially ordered high stable Ordered partially ordered medium medium stability Slice And Dice ordered very high stable Squarified[2] unordered lowest medium stability Strip ordered medium medium stability Mixed Treemaps[3] ordered lowest stable In addition, several algorithms have been proposed that use non-rectangular regions: * Voronoi Treemaps - based on voronoi diagram calculations * Jigsaw Treemaps - based on the geometry of space-filling curves " source: http://en.wikipedia.org/wiki/Treemapping#The_tiling_algorithm