Abstract
We present a generic algorithm to sequentially pave a rectangular area with smaller, fixed-surface, rectangles. The parameters of this algorithm are functional, and it covers the full design space con- sidered. This class of layouts is interesting, because it includes all kinds of treemaps involving the placement of rectangles. For instance, Slice and dice, Squarified, Strip and Pivot layouts are ob- tained through various formulations of two simple chunking and phrasing functions. Some new and potentially interesting layouts which can be generated using our algorithm are introduced, such as spiral treemaps and data dependent variations of known layout strategies.
Cite
CITATION STYLE
Baudel, T., & Broeksema, B. (2011). A generic algorithm for sequential , rectangular , space filling layouts.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.