Computing voronoi treemaps: Faster, simpler, and resolution-independent

Computer Graphics Forum

Volumn 31, Issue 3 PART1, 2012, Pages 855-864

  Nocaj, Arlind ^a   Brandes, Ulrik ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTER GRAPHICS; FORESTRY; GRAPHIC METHODS;

CENTROIDAL VORONOI DIAGRAMS; GRAPHICS HARDWARE; LLOYD'S METHOD; LOW RESOLUTION; POWER DIAGRAMS; RUNNING-IN; VORONOI TREEMAPS; WEIGHTED VORONOI DIAGRAM;

ITERATIVE METHODS;

EID: 84867642144     PISSN: 01677055     EISSN: 14678659     Source Type: Journal    
DOI: 10.1111/j.1467-8659.2012.03078.x     Document Type: Article

References (27)

1. [Aur87] AURENHAMMER F.: Power diagrams: properties, algorithms, and applications. SIAM Journal on Computing 16, 1 (1987), 78-96. 2, 6
2. [BD05] BALZER M., DEUSSEN O.: Voronoi treemaps. In Proceedings of IEEE Symposium of Information Visualization (Info- Vis'05) (2005), IEEE Computer Society Press, p. 7. 1, 3, 8
3. [BDL05] BALZER M., DEUSSEN O., LEWERENTZ C.: Voronoi treemaps for the visualization of software metrics. In Proceedings of the 2nd ACM Symposium on Software metrics (2005), ACM Press, pp. 165-172. 3
4. [BFHS09] BERNHARDT J., FUNKE S., HECKER M., SIEBOURG J.: Visualizing gene expression data via voronoi treemaps. In Proceedings of the 2009 Sixth International Symposium on Voronoi Diagrams (2009), IEEE Computer Society Press, pp. 233-241. 1, 4
5. [CM95] CHAZELLE B., MATOUŠEK J.: Derandomizing an output-sensitive convex hull algorithm in three dimensions. Computational Geometry 5 (1995), 27-32. 7
6. [CMS93] CLARKSON K., MEHLHORN K., SEIDEL R.: Four results on randomized incremental constructions. Computational Geometry 3 (1993), 185-212. 7
7. [Cox03] COXETER H. S. M.: Projective Geometry. Springer, 2003. 6
8. [CS89] CLARKSON K., SHOR P.: Applications of random sampling in computational geometry, ii. Discrete & Computational Geometry 4 (1989), 387-421. 7
9. [Day90] DAY A. M.: The implementation of an algorithm to find the convex hull of a set of three-dimensional points. ACM Transactions on Graphics 9 (January 1990), 105-132. 7
10. [dBCvKO08] DE BERG M., CHEONG O., VAN KREVELD M., OVERMARS M. H.: Computational Geometry: Algorithms and Applications. Springer-Verlag, 2008. 7
11. [Ede87] EDELSBRUNNER H.: Algorithms in combinatorial geometry. EACTS Monographs on Theoretical Computer Science. Springer-Verlag, 1987. 7
12. [ES91] EDELSBRUNNER H., SHI W.: An o(nlog2 h) time algorithm for the three-dimensional convex hull problem. SIAM Journal on Computing 20 (March 1991), 259-269. 7
13. [For87] FORTUNE S.: A sweepline algorithm for voronoi diagrams. Algorithmica 2 (1987), 153-174. 2, 9
14. [GO04] GOODMAN J. E., O'ROURKE J.: Handbook of Discrete and Computational Geometry. Discrete Mathematics and its Applications. CRC Press, 2004. 2
15. [Got11] GOTZ D.: Dynamic Voronoi Treemaps: A Visualization Technique for Time-Varying Hierarchical Data. Tech. Rep. RC25132, IBM Research Division, Thomas J. Watson Research Center, 2011. 1, 4
16. [HTS09] HORN M. S., TOBIASZ M., SHEN C.: Visualizing biodiversity with voronoi treemaps. In Proceedings of the 2009 Sixth International Symposium on Voronoi Diagrams (2009), IEEE Computer Society Press, pp. 265-270. 1, 4
17. [Llo57] LLOYD S. P.: Least squares quantization in PCM's. Tech. rep., Bell Laboritories Memo, 1957. 3
18. [LWL-09] LIU Y., WANG W., LÉVY B., SUN F., YAN D.-M., LU L., YANG C.: On centroidal voronoi tessellation: energy smoothness and fast computation. ACM Transactions on Graphics 28 (2009), 101:1-101:17. 2, 4
19. [OBSC00] OKABE A., BOOTS B., SUGIHARA K., CHIU S. N.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, 2nd ed. Wiley, 2000. 7
20. [OCON82] O'ROURKE J., CHIEN C.-B., OLSON T., NADDOR D.: A new linear algorithm for intersecting convex polygons. Computer Graphics and Image Processing 19, 4 (1982), 384- 391. 7
21. [O'R98] O'ROURKE J.: Computational Geometry in C. Cambridge University Press, 1998. 7
22. [PH77] PREPARATA F. P., HONG S. J.: Convex hulls of finite sets of points in two and three dimensions. Communications of the ACM 20 (February 1977), 87-93. 7
23. [RLW-11] RONG G., LIU Y., WANG W., YIN X., GU X. D., GUO X.: Gpu-assisted computation of centroidal voronoi tessellation. IEEE Transactions on Visualization and Computer Graphics 17 (2011), 345-356. 3
24. [SFL10] SUD A., FISHER D., LEE H.-P.: Fast dynamic voronoi treemaps. In Proceedings of the 7th International Symposium on Voronoi Diagrams in Science and Engineering (2010), ISVD '10, IEEE Computer Society, pp. 85-94. 2, 3, 8
25. [Shn92] SHNEIDERMAN B.: Tree visualization with tree-maps: 2-d space-filling approach. ACM Transactions on Graphics 11 (1992), 92-99. 1, 2
26. [Shn09] SHNEIDERMAN B.: Treemaps for space-constrained visualization of hierarchies. webpage, June 2009. http://www.cs.umd.edu/hcil/treemap-history/, visited on November 2011. 1
27. [VSCG08] VASCONCELOS C., SÁ A., CARVALHO P., GATTASS M.: Lloyd's algorithm on gpu. In Advances in Visual Computing, vol. 5358 of Lecture Notes in Computer Science. Springer- Verlag, 2008, pp. 953-964. 3