Part of a whole

Voronoi treemap

Represents hierarchical composition with recursively partitioned polygons sized by value.

  • Chart
  • Hierarchy
  • Composition

What it answers

How is size distributed within a hierarchy?

Shape
Nested irregular polygons
What it shows
Large branches and nested shares.

Example

The question

Which product categories and lines bring in the most revenue?

Revenue by category and product line, 2025 (Voronoi treemap)

Revenue by category and product line, 2025 (Voronoi treemap)A circle split into irregular cells: thick borders mark categories, inner cells product lines, area in proportion to revenue. Computing 33 (laptops 18, monitors 9, tablets 6); mobile 21 (phones 14, cases 4, chargers 3); audio 15 (headphones 8, speakers 7); accessories 5 (cables 3, bags 2). EUR million.Laptops18Monitors9Tablets6Phones14Headphones8Speakers7ComputingMobileAudioAccessoriesCell area is in proportion to revenue
Revenue by category and product line, 2025 (Voronoi treemap)A circle split into irregular cells: thick borders mark categories, inner cells product lines, area in proportion to revenue. Computing 33 (laptops 18, monitors 9, tablets 6); mobile 21 (phones 14, cases 4, chargers 3); audio 15 (headphones 8, speakers 7); accessories 5 (cables 3, bags 2). EUR million.Laptops18Monit.9Tablets6Phones14Headp.8Speak.7
A circle split into irregular cells: thick borders mark categories, inner cells product lines, area in proportion to revenue. Computing 33 (laptops 18, monitors 9, tablets 6); mobile 21 (phones 14, cases 4, chargers 3); audio 15 (headphones 8, speakers 7); accessories 5 (cables 3, bags 2). EUR million.

Illustrative data. It belongs to no company.

When to use it

Use it when

Exploratory hierarchical composition with a distinctive layout.

Avoid it when

Precise comparisons or unfamiliar audiences.

How to read it

Follow polygon containment and compare areas using labels.

The data you need

Layout
Parent-child table
Fields
NodeID: text; ParentID: text/blank; Label: text; Value: number when size is encoded
One row is
One node in a parent-child hierarchy. What is the grain?
Rules
Node IDs must be unique. Parents must exist. Reject cycles. Define leaf-only versus inclusive parent values.
Optional
Alternative: Level1,Level2...,Value. Tree diagrams can omit Value.
Preparation
Validate unique node IDs, parent links, roots and absence of cycles. For size-encoded hierarchies, state whether totals are leaf-only or inclusive.
Units
Tree levels and branch position are structural. Size-encoded components use a named value unit; parent shares divide by the chosen parent total.
Example of the input layout: Parent-child tableA parent-child table: each row names its parent, which together form the tree.NodeParentTopATopBTopA1AA2ATopABA1A2
A parent-child table: each row names its parent, which together form the tree.

Worked example

Root 100 with A60, B40 is partitioned into polygons of 60% and 40% area. Further subdivision stays inside its parent.

NodeIDParentIDLabelValue
rootAll100
arootA60
brootB40