Fast agglomerative clustering for rendering

RT'08 - IEEE/EG Symposium on Interactive Ray Tracing 2008, Proceedings

Volumn , Issue , 2008, Pages 81-86

  Walter, Bruce ^a   Bala, Kavita ^a   Kulkarni, Milind ^b   Pingali, Keshav ^b  

^a Cornell University ^*

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Agglomerative clustering; Bottom up tree construction; Bounding volume hierarchy; Dendogram; Lightcuts rendering

Indexed keywords

AGGLOMERATIVE CLUSTERING; BOTTOM-UP TREE CONSTRUCTION; BOUNDING VOLUME HIERARCHY; DENDOGRAM; LIGHTCUTS RENDERING;

BINARY TREES; CLUSTER ANALYSIS; CLUSTERING ALGORITHMS; ELEMENTARY PARTICLE SOURCES; FLOW OF SOLIDS; LEARNING SYSTEMS; RAY TRACING;

TREES (MATHEMATICS);

EID: 56649096133     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RT.2008.4634626     Document Type: Conference Paper

References (23)

1. J. Arvo and D. Kirk. A survey of ray tracing acceleration techniques. In A. S. Glassner, editor, An Introduction to Ray Tracing. Academic Press, San Diego, CA, 1989.
2. G. Barequet and G. Elber. Optimal bounding cones of vectors in three dimensions. Information Processing Letters, 93:83-89, January 2005.
3. D. Beeferman and A. Berger. Agglomerative clustering of a search engine query log. In Knowledge Discovery and Data Mining, pages 407-416, 2000.
4. P. Berkhin. Survey of clustering data mining techniques. Technical report, Accrue Software, San Jose, CA, 2002.
5. M. B. Eisen, P. T. Spellman, P. O. Brown, and D. Botstein. Cluster Analysis and Display of Genome-Wide Expression Patterns. Proc. of the National Academy of Science, 95:14863-14868, Dec. 1998.
6. B. Gärtner. Fast and robust smallest enclosing balls. In ESA '99: European Symposium on Algorithms, pages 325-338, 1999.
7. J. Goldsmith and J. Salmon. Automatic creation of object hierarchies for ray tracing. IEEE Comp. Graphics & Applications, May 1987.
8. S. Guha, R. Rastogi, and K. Shim. CURE: an efficient clustering algorithm for large databases. In In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 73-84, 1998.
9. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review. ACM Computing Surveys, 31(3):264-323, 1999.
10. M. Kulkarni, K. Pingali, G. Ramanarayanan, B. Walter, K. Bala, and L. P. Chew. Optimistic parallelism benefits from data partitioning. In ASPLOS XIII: Architectural support for programming languages and operating systems, pages 233-243. ACM, 2008.
11. M. Kulkarni, K. Pingali, G. Ramanarayanan, B. Walter, P. Carribault, P. Chew, and K. Bala. Scheduling strategies for optimistic parallel execution of irregular programs. ACM Symposium on Parallelism in Algorithms and Architectures, June 2008.
12. M. Kulkarni, K. Pingali, B. Walter, G. Ramanarayanan, K. Bala, and L. P. Chew. Optimistic parallelism requires abstractions. ACM Conf on Programming Language Design and Implementation (PLDI), 2007.
13. T. Larsson and T. Akenine-Möller. Strategies for bounding volume hierarchy updates for ray tracing of deformable models. Technical Report, Mälardalen University, February 2003.
14. J. P. M. Massó and P. G. López. Automatic hybrid hierarchy creation: a cost-model based approach. Comp. Graphics Forum, Mar. 2003.
15. M. Miksik. Implementing lightcuts. In Central European Seminar on Computer Graphics for students, 2007.
16. C. F. Olson. Parallel algorithms for hierarchical clustering. Parallel Computing, 21(8):1313-1325, 1995.
17. J. Ritter. An efficient bounding sphere. In Graphics Gems I, pages 301-303, 723-725. Academic Press, 1990.
18. I. Wald. On fast Construction of SAH based Bounding Volume Hierarchies. In Symposium on Interactive Ray Tracing, 2007.
19. I. Wald, S. Boulos, and P. Shirley. Ray Tracing Deformable Scenes using Dynamic Bounding Volume Hierarchies. ACM Transactions on Graphics, 26(1), 2007.
20. I. Wald, W. R. Mark, J. Günther, S. Boulos, T. Ize, W. Hunt, S. G. Parker, and P. Shirley. State of the Art in Ray Tracing Animated Scenes. In Eurographics 2007 State of the Art Reports, 2007.
21. B. Walter, A. Arbree, K. Bala, and D. P. Greenberg. Multidimensional lightcuts. ACM Trans. on Graphics, 25(3):1081-1088, July 2006.
22. B. Walter, S. Fernandez, A. Arbree, K. Bala, M. Donikian, and D. P. Greenberg. Implementing lightcuts. In ACM SIGGRAPH 2005 Sketches, page 55, New York, NY, USA, 2005. ACM Press.
23. B. Walter, S. Fernandez, A. Arbree, K. Bala, M. Donikian, and D. P. Greenberg. Lightcuts: a scalable approach to illumination. ACM Transactions on Graphics, 24(3):1098-1107, Aug. 2005.