Python implementation of the one-layer treemap layout algorithm. Expanded the original version by adding x and y alignment axes, so the tiled treemap can represent 4-D information.

Computing treemap layouts for time-dependent (dynamic) trees is an open problem in information visualization. In particular, the constraints of spatial quality (cell aspect ratio) and stability (small ...

This paper presents a new approach to the large graph layout problem, which quickly generates an effective layout. This new method proceeds by generating a clustering hierarchy for the graph, applying ...