Find out about Radial Treemaps and create your individual with Python
![Towards Data Science](https://miro.medium.com/v2/resize:fill:48:48/1*CJe3891yB1A1mzMdqemkdg.jpeg)
The Treemap Idea
The “Treemap” was launched by Ben Shneiderman on the College of Maryland within the early 1990s¹. Merely put, it’s an environment friendly means of displaying hierarchical information as a set of nested rectangles. Though the idea is easy, the association of the rectangles is topic to an aesthetic choice, and varied association algorithms have been developed to reinforce the looks of the ultimate structure.
Treemap Mechanics
Given a hierarchy, a Treemap represents every department within the hierarchy as a rectangle, which is then tiled with smaller rectangles representing sub-branches. The area in a Treemap is split in line with a particular attribute of the info (typically dimension or worth), and every rectangle’s space corresponds to the attribute’s magnitude, making it simple to match totally different elements of the hierarchy.
To account for the association of the rectangles, listed here are a few of the widespread algorithms that govern a Treemap’s building and supreme look:
Squarified Treemaps² – creates rectangles as near squares as attainable by adjusting the side ratio of the rectanglesStrip Treemaps³ – lays out the rectangles in strips, both horizontally or vertically, based mostly on the info’s hierarchySlice-and-Dice⁴ – alternates between horizontal and vertical divisions which is simple however can create elongated rectangles
Treemap Options
Proportions – the scale of every rectangle is proportional to the info level it represents, permitting fast identification of bigger and smaller itemsLines and Colours – intelligent utilization of borders, border dimension and shade, and buffers can delineate hierarchy ranges whereas container colours are sometimes used to signify totally different dimensions of the dataSpatial Effectivity – Treemaps…