Computing Voronoi Treemaps: Faster, Simpler, and Resolution-independent
Computer Graphics Forum
Rectangle orientation in area judgment task for treemap design
Proceedings of the 24th Australian Computer-Human Interaction Conference
Visualizing large trees with divide & conquer partition
Proceedings of the 6th International Symposium on Visual Information Communication and Interaction
| Hi-index | 0.00 |
The Voronoi Treemap is a space-filling treemap technique that relaxes the constraints of rectangular nodes. Its organic shapes maintain a one-to-one aspect ratio, are flexible with their placement, allowing stable zooming and dynamic data values. In this paper, we present algorithms for efficient computation and dynamic update of Voronoi Treemaps. Our GPGPU-based technique allows for rapid computation of centroidal Voronoi Diagrams, providing almost two orders of magnitude speedup over previous work. In addition, we present a hierarchical algorithm for stable updates. Finally, we demonstrate the application of Voronoi treemaps to real-world dynamic datasets, including interactive navigation.