
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
TaeJoon Kim, Bochang Moon, Duksu Kim, SungEui Yoon, "RACBVHs: RandomAccessible Compressed Bounding Volume Hierarchies," IEEE Transactions on Visualization and Computer Graphics, vol. 16, no. 2, pp. 273286, March/April, 2010.  
BibTex  x  
@article{ 10.1109/TVCG.2009.71, author = {TaeJoon Kim and Bochang Moon and Duksu Kim and SungEui Yoon}, title = {RACBVHs: RandomAccessible Compressed Bounding Volume Hierarchies}, journal ={IEEE Transactions on Visualization and Computer Graphics}, volume = {16}, number = {2}, issn = {10772626}, year = {2010}, pages = {273286}, doi = {http://doi.ieeecomputersociety.org/10.1109/TVCG.2009.71}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Visualization and Computer Graphics TI  RACBVHs: RandomAccessible Compressed Bounding Volume Hierarchies IS  2 SN  10772626 SP273 EP286 EPD  273286 A1  TaeJoon Kim, A1  Bochang Moon, A1  Duksu Kim, A1  SungEui Yoon, PY  2010 KW  Hierarchy and BVH compression KW  random access KW  cachecoherent layouts KW  ray tracing KW  collision detection. VL  16 JA  IEEE Transactions on Visualization and Computer Graphics ER   
[1] J.L. Hennessy, D.A. Patterson, and D. Goldberg, Computer Architecture, A Quantitative Approach. Morgan Kaufmann, 2007.
[2] S.M. Rubin and T. Whitted, “A 3Dimensional Representation for Fast Rendering of Complex Scenes,” Computer Graphics, vol. 14, no. 3, pp. 110116, 1980.
[3] M. Lin and D. Manocha, “Collision and Proximity Queries,” Handbook of Discrete and Computational Geometry, 2003.
[4] M. Teschner, S. Kimmerle, B. Heidelberger, G. Zachmann, L. Raghupathi, A. Fuhrmann, M.P. Cani, F. Faure, N. MagnenatThalmann, W. Strasser, and P. Volino, “Collision Detection for Deformable Objects,” Computer Graphics Forum, vol. 19, no. 1, pp.6181, 2005.
[5] P.M. Hubbard, “Interactive Collision Detection,” Proc. IEEE Symp. Research Frontiers in Virtual Reality, pp. 2431, 1993.
[6] G. van den Bergen, “Efficient Collision Detection of Complex Deformable Models Using AABB Trees,” J. Graphics Tools, vol. 2, no. 4, pp. 113, 1997.
[7] S. Gottschalk, M. Lin, and D. Manocha, “OBBTree: A Hierarchical Structure for Rapid Interference Detection,” Proc. ACM SIGGRAPH, pp. 171180, 1996.
[8] J. Klosowski, M. Held, J. Mitchell, H. Sowizral, and K. Zikan, “Efficient Collision Detection Using Bounding Volume Hierarchies of kdops,” IEEE Trans. Visualization and Computer Graphics, vol. 4, no. 1, pp. 2136, Jan.Mar. 1998.
[9] I. Wald, “Realtime Ray Tracing and Interactive Global Illumination,” PhD dissertation, Computer Graphics Group, Saarland Univ., 2004.
[10] P. Alliez and C. Gotsman, “Recent Advances in Compression of 3D Meshes,” Advances in Multiresolution for Geometric Modelling, pp. 326, 2004.
[11] C. Gotsman, S. Gumhold, and L. Kobbelt, “Simplification and Compression of 3D Meshes,” Tutorials on Multiresolution in Geometric Modelling, pp. 319361, Springer, 2002.
[12] C. Touma and C. Gotsman, “Triangle Mesh Compression,” Proc. Conf. Graphics Interface, pp. 2634, 1998.
[13] O. Devillers and P.M. Gandoin, “Geometric Compression for Interactive Transmission,” Proc. IEEE Conf. Visualization, pp. 319326, 2000.
[14] J. Peng and C.C.J. Kuo, “GeometryGuided Progressive Lossless 3D Mesh Coding with octree (OT) Decomposition,” ACM Trans. Graphics, vol. 24, no. 3, pp. 609616, 2005.
[15] P. Alliez and M. Desbrun, “ValenceDriven Connectivity Encoding for 3D Meshes,” Proc. Conf. Eurographics, pp. 480489, 2001.
[16] F. Kälberer, K. Polthier, U. Reitebuch, and M. Wardetzky, “Freelence—Coding with Free Valences,” Computer Graphics Forum, vol. 24, no. 3, pp. 469478, 2005.
[17] M. Isenburg and J. Snoeyink, “Face Fixer: Compressing Polygon Meshes with Properties,” Proc. ACM SIGGRAPH, pp. 263270, 2000.
[18] S. Gumhold and W. Strasser, “Real Time Compression of Triangle Mesh Connectivity,” Proc. ACM SIGGRAPH, pp. 133140, 1998.
[19] J. Rossignac, “Edgebreaker: Connectivity Compression for Triangle Meshes,” IEEE Trans. Visualization and Computer Graphics, vol. 5, no. 1, pp. 4761, Jan.Mar. 1999.
[20] H. Lee, P. Alliez, and M. Desbrun, “AngleAnalyzer: A TriangleQuad Mesh Codec,” Computer Graphics Forum, vol. 21, pp. 383392, 2002.
[21] S. Choe, J. Kim, H. Lee, S. Lee, and H.P. Seidel, “Mesh Compression with Random Accessibility,” Proc. IsraelKorea BiNat'l Conf., pp. 8186, 2004.
[22] S. Choe, J. Kim, H. Lee, and S. Lee, “Random Accessible Mesh Compression Using Mesh Chartification,” IEEE Trans. Visualization and Computer Graphics, vol. 15, no. 1, pp. 160173, Jan./Feb. 2009.
[23] S.E. Yoon and P. Lindstrom, “RandomAccessible Compressed Triangle Meshes,” IEEE Trans. Visualization and Computer Graphics, vol. 13, no. 6, pp. 15361543, Nov./Dec. 2007.
[24] E. Gobbetti, F. Marton, P. Cignoni, M. Di Benedetto, and F. Ganovelli, “Cbdam—Compressed Batched Dynamic Adaptive Meshes for Terrain Rendering,” Computer Graphics Forum, vol. 25, no. 3, pp. 333342, 2006.
[25] J. Kim, S. Choe, and S. Lee, “Multiresolution Random Accessible Mesh Compression,” Proc. Conf. Eurographics, vol. 25, no. 3, pp.323332, 2006.
[26] D.L. Gall, “Mpeg: A Video Compression Standard for Multimedia Applications,” Comm. ACM, vol. 34, pp. 4658, 1991.
[27] I. Ihm and S. Park, “WaveletBased 3D Compression Scheme for Interactive Visualization of Very Large Volume Data,” Computer Graphics Forum, vol. 18, no. 1, pp. 315, 1999.
[28] F. Rodler, “Wavelet Based 3D Compression with Fast Random Access for Very Large Volume Data,” Proc. Pacific Conf. Computer Graphics and Applications, pp. 108117, 1999.
[29] S. Lefebvre and H. Hoppe, “Perfect Spatial Hashing,” Proc. ACM SIGGRAPH, pp. 579588, 2006.
[30] J. Katajainen and E. Makinen, “Tree Compression and Optimization with Applications,” Int'l J. Foundations of Computer Science, vol. 1, no. 4, pp. 425447, 1990.
[31] S. Zaks, “Lexicographic Generation of Ordered Trees,” Theoretical Computer Science, vol. 10, pp. 6382, 1980.
[32] D. Zerling, “Generating Binary Trees Using Rotations,” J. ACM, vol. 32, no. 3, pp. 694701, 1985.
[33] A. Gersho and R.M. Gray, Vector Quantization and Signal Compression. Kluwer Academic Publishers, 1991.
[34] D. Cline, K. Steele, and P.K. Egbert, “Lightweight Bounding Volumes for Ray Tracing,” J. Graphics Tools, vol. 11, no. 4, pp. 6171, 2006.
[35] J. Mahovsky, “Ray Tracing with ReducedPrecision Bounding Volume Hierarchies,” PhD thesis, Univ. of Calgary, 2005.
[36] P. Terdiman, “Opcode: Optimized Collision Detection,” http://www.codercorner.comOpcode.htm, 2003.
[37] S. Rusinkiewicz and M. Levoy, “Qsplat: A Multiresolution Point Rendering System for Large Meshes,” Proc. ACM SIGGRAPH, pp.343352, 2000.
[38] E. Hubo, T. Mertens, T. Haber, and P. Bekaert, “The Quantized kdTree: Efficient Ray Tracing of Compressed Point Clouds,” Proc. IEEE Symp. Interactive Ray Tracing, pp. 105113, 2006.
[39] D. Salomon, Data Compression. Springer, 2007.
[40] C. Lauterbach, S.E. Yoon, and D. Manocha, “RayStrips: A Compact Mesh Representation for Interactive Ray Tracing,” Proc. IEEE/EG Symp. Interactive Ray Tracing, pp. 1926, 2007.
[41] C. Lauterbach, S.E. Yoon, M. Tang, and D. Manocha, “ReduceM: Interactive and Memory Efficient Ray Tracing of Large Models,” Computer Graphics Forum, vol. 27, no. 4, pp. 13131321, 2008.
[42] S. Lefebvre and H. Hoppe, “Compressed RandomAccess Trees for Spatially Coherent Data,” Proc. Eurographics Symp. Rendering, pp. 339349, 2007.
[43] I. Wald, “On Fast Construction of SAH Based Bounding Volume Hierarchies,” Proc. EG/IEEE Symp. Interactive Ray Tracing, pp. 3340, 2007.
[44] I. Wald, S. Boulos, and P. Shirley, “Ray Tracing Deformable Scenes Using Dynamic Bounding Volume Hierarchies,” ACM Trans. Graphics, vol. 26, no. 1, p. 6, 2007.
[45] L. Arge, G. Brodal, and R. Fagerberg, “Cache Oblivious Data Structures,” Handbook on Data Structures and Applications, 2004.
[46] M. Isenburg and P. Lindstrom, “Streaming Meshes,” Proc. IEEE Conf. Visualization, pp. 231238, 2005.
[47] P. van Emde Boas, “Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space,” Information Processing Letters, vol. 6, pp. 8082, 1977.
[48] S.E. Yoon and D. Manocha, “CacheEfficient Layouts of Bounding Volume Hierarchies,” Computer Graphics Forum, vol. 25, no. 3, pp.507516, 2006.
[49] C. Silva, Y.J. Chiang, W. Correa, J. ElSana, and P. Lindstrom, “OutofCore Algorithms for Scientific Visualization and Computer Graphics,” Proc. IEEE Conf. Visualization Course Notes, 2002.
[50] M. Isenburg and S. Gumhold, “OutofCore Compression for Gigantic Polygon Meshes,” Proc. ACM SIGGRAPH, pp. 935942, 2003.
[51] S.E. Yoon, D. Manocha, P. Lindstrom, and V. Pascucci, “Openccl,” http://gamma.cs.unc.edu/COLOpenCCL, 2005.
[52] A. Moffat, R.M. Neal, and I.H. Witten, “Arithmetic Coding Revisited,” ACM Trans. Information Systems, vol. 16, no. 3, pp.256294, 1998.
[53] J. Klosowski, M. Held, J.S.B. Mitchell, K. Zikan, and H. Sowizral, “Efficient Collision Detection Using Bounding Volume Hierarchies of $k$ DOPs,” IEEE Trans. Visualization and Computer Graphics, vol. 4, no. 1, pp. 2136, Jan.Mar. 1998.
[54] A. Reshetov, A. Soupikov, and J. Hurley, “MultiLevel Ray Tracing Algorithm,” ACM Trans. Graphics, vol. 24, no. 3, pp.11761185, 2005.
[55] C. Lauterbach, S. Yoon, D. Tuft, and D. Manocha, “RTDEFORM: Interactive Ray Tracing of Dynamic Scenes Using BVHS,” Proc. IEEE Symp. Interactive Ray Tracing, pp. 3945, 2006.
[56] R.L. Cook, T. Porter, and L. Carpenter, “Distributed Ray Tracing,” Proc. ACM SIGGRAPH, pp. 137145, 1984.
[57] B. Mirtich and J. Canny, “ImpulseBased Simulation of Rigid Bodies,” Proc. Symp. Interactive 3D Graphics, pp. 181188, 1995.
[58] A. Silberschatz, P.B. Galvin, and G. Gagne, Operating System Concepts. Jon Wiley and Sons, 2003.
[59] J. loup Gailly and M. Adler, “zlib,” http:/www.zlib.net, 2005.
[60] L. Seiler, D. Carman, E. Sprangle, T. Forsyth, M. Abrash, P. Dubey, S. Junkins, A. Lake, J. Sugerman, R. Cavin, R. Espasa, E. Grochowski, T. Juan, and P. Hanrahan, “Larrabee: A ManyCore x86 Architecture for Visual Computing,” ACM Trans. Graphics, vol. 27, no. 3, pp. 115, 2008.