This chart displayes hierarchical data in a radial layout: The circle in the chart center represents the hierarchy's root node. Sections further outside represent nodes that are located deeper in the hierarchy.
Each leaf node has a attached value attribute. For sections corresponding to leaf nodes, the area is derived from the leaf node's value attribute. For sections not corresponding to leaf nodes, the area is derived from the accumulated value of all descending leaf nodes.
This node expects a data structure that satisfies certain requirements:
- Each row represents the path from the root node to a leaf node.
- The user selects multiple path columns. Each path column gives the labels for a respective hierarchy level.
- The number of path columns corresponds to the maximal depth of the hierarchy.
- Paths shorter then the maximal depth need to be filled up with missing values.
- The user selected value column gives the leaf node's attached value attribute.
The following table gives an example for such a data structure: