Yan Gu
Yong He
ABSTRACT
We introduce Approximate Agglomerative Clustering (AAC), an efficient, easily parallelizable algorithm for generating high-quality bounding volume hierarchies using agglomerative clustering. The main idea of AAC is to compute an approximation to the true greedy agglomerative clustering solution by restricting the set of candidates inspected when identifying neighboring geometry in the scene. The result is a simple algorithm that often produces higher quality hierarchies (in terms of subsequent ray tracing cost) than a full sweep SAH build yet executes in less time than the widely used top-down, approximate SAH build algorithm based on binning.
- Bern, M., Eppstein, D., and Teng, S.-H. 1999. Parallel construction of quadtrees and quality triangulations. International Journal of Computational Geometry and Applications 9, 6, 517--532.Google Scholar
Cross Ref
- Bittner, J., Hapala, M., and Havran, V. 2013. Fast insertion-based optimization of bounding volume hierarchies. Computer Graphics Forum 32, 1, 85--100.Google ScholarCross Ref
- Ernst, M., and Greiner, G. 2007. Early split clipping for bounding volume hierarchies. In Proceedings of the 2007 IEEE Symposium on Interactive Ray Tracing, IEEE Computer Society, RT '07, 73--78. Google ScholarDigital Library
- Gargantini, I. 1982. An effective way to represent quadtrees. Communications of the ACM 25, 12, 905--910. Google ScholarDigital Library
- Goldsmith, J., and Salmon, J. 1987. Automatic creation of object hierarchies for ray tracing. IEEE Computer Graphics and Applications 7, 5 (May), 14--20. Google ScholarDigital Library
- Karras, T. 2012. Maximizing parallelism in the construction of BVHs, octrees, and K-D trees. In Proceedings of the Conference on High Performance Graphics, Eurographics Association, HPG'12, 33--37. Google ScholarDigital Library
- Lauterbach, C., Garl, M., Sengupta, S., Luebke, D., and Manocha, D. 2009. Fast BVH construction on GPUs. In In Proc. Eurographics '09.Google Scholar
- Olson, C. F. 1995. Parallel algorithms for hierarchical clustering. Parallel Computing 21, 1313--1325. Google ScholarDigital Library
- Shun, J., Blelloch, G. E., Fineman, J. T., Gibbons, P. B., Kyrola, A., Simhadri, H. V., and Tangwongsan, K. 2012. Brief announcement: the Problem Based Benchmark Suite. In Proc. ACM Symp. on Parallelism in Algorithms and Architectures. Google ScholarDigital Library
- Wald, I., Mark, W. R., Günther, J., Boulos, S., Ize, T., Hunt, W., Parker, S. G., and Shirley, P. 2007. State of the art in ray tracing animated scenes. In Computer Graphics Forum.Google Scholar
- Wald, I. 2007. On fast construction of SAH-based bounding volume hierarchies. In Interactive Ray Tracing, 2007. RT '07. IEEE Symposium on, 33--40. Google ScholarDigital Library
- Wald, I. 2012. Fast construction of SAH BVHs on the Intel Many Integrated Core (MIC) architecture. IEEE Transactions on Visualization and Computer Graphics 18, 1 (Jan.), 47--57. Google ScholarDigital Library
- Walter, B., Bala, K., Kulkarni, M., and Pingali, K. 2008. Fast agglomerative clustering for rendering. In Interactive Ray Tracing, 2008. RT 2008. IEEE Symposium on, 81--86.Google Scholar
Index Terms
- Efficient BVH construction via approximate agglomerative clustering
Recommendations
Parallel BVH construction using k-means clustering
We propose a novel method for fast parallel construction of bounding volume hierarchies (BVH) on the GPU. Our method is based on a combination of divisible and agglomerative clustering. We use the k-means algorithm to subdivide scene primitives into ...
Grid-based SAH BVH construction on a GPU
CGI'2011 ConferenceWe present an efficient algorithm for building an adaptive bounding volume hierarchy (BVH) in linear time on commodity graphics hardware using CUDA. BVHs are widely used as an acceleration data structure to quickly ray trace animated polygonal scenes. ...
Effective Criterion Functions for Efficient Agglomerative Clustering on Very Large Networks
ICDM '09: Proceedings of the 2009 Ninth IEEE International Conference on Data MiningAs the agglomerative clustering algorithm is widely used in data mining, image processing, bioinformatics and pattern recognition. it has attracted great interests from both academical and industrial communities. However, existing studies neglect the ...
Comments