Data visualization |

Input Data / m

Treemaps display hierarchical (tree-structured) data as a set of nested rectangles. Each branch of the tree is given a rectangle, which is then tiled with smaller rectangles representing sub-branches. A leaf node’s rectangle has an area proportional to a specified dimension on the data. Often the leaf nodes are colored to show a separate dimension of the data.


Similar to a regular square treemap, but convex polygons are used instead of rectangles e.g. a new hierarchical partition scheme, also called a polygonal partition, which uses convex polygons rather than just rectangles.
Treemaps display hierarchical (tree-structured) data as a set of nested polygons. Each branch of the tree is given a polygons, which is then tiled with smaller polygons representing sub-branches.
The use of Convex Treemaps compared to regular tree maps would be when you want to show grouping and realtions instead of the strict hierachical structure of a a normal treemap.

Convex treemap

Circle Packing is a method to visualize large amounts of hierarchically structured data. Tangent circles represent brother nodes at the same level; to visualize the hierarchy, all children of a node are packed into that node (and thus determine its size). The size of a leaf-node can represent an arbitrary property, such as file size. An advantage of this algorithm is the good overview of large data sets and the clear representation of groupings and structural relationships.

Packed Circle Chart

Nested circles allow to represent hierarchies and compare values. This visualization is particularly effective to show the proportion between elements through their areas and their position inside a hierarchical structure.

Clustered Force Layout