Visual Computing

University of Konstanz
Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization

Voronoi Treemaps

M. Balzer, O. Deussen
Teaser of Voronoi Treemaps


Paper (.pdf, 19.0MB) Result_Flare (.pdf, 703.5KB) CSV_Flare (.csv, 7.8KB) Example (.pdf, 12.1MB) Example (.pdf, 12.1MB) Example (.pdf, 12.3MB) Github


Treemaps are a well-known method for the visualization of attributed hierarchical data. Previously proposed Treemap layout algorithms are limited to rectangular shapes, which causes problems with the aspect ratio of the rectangles as well as with identifying the visualized hierarchical structure. The approach of Voronoi Treemaps presented in this paper eliminates these problems through enabling subdivisions of and in polygons. Additionally, this allows for creating Treemap visualizations within areas of arbitrary shape, such as triangles and circles, thereby enabling a more flexible adaptation of Treemaps for a wider range of applications.


  acmid     = {1106574},
  address   = {Washington, DC, USA},
  author    = {M. Balzer, O. Deussen},
  booktitle = {Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization},
  doi       = {10.1109/INFOVIS.2005.40},
  isbn      = {0-7803-9464-x},
  keywords  = {Voronoi Treemaps, Information Visualization, Hierarchies, Trees, Treemaps, Voronoi Tessellations},
  pages     = {7--},
  publisher = {IEEE Computer Society},
  series    = {INFOVIS '05},
  title     = {Voronoi Treemaps},
  url       = {},
  year      = {2005}