RACBVHs: random-accessible compressed bounding volume hierarchies

Bounding volume hierarchies (BVHs) are widely used to accelerate the performance of various geometric and graphics applications. These applications include ray tracing, collision detection, visibility queries, dynamic simulation, and motion planning. These applications typically precompute BVHs of input models and traverse the BVHs at runtime in order to perform intersection or culling tests.

[1]  Sylvain Lefebvre,et al.  Compressed Random-Access Trees for Spatially Coherent Data , 2007, Rendering Techniques.

[2]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[3]  Shmuel Zaks,et al.  Lexicographic Generation of Ordered Trees , 1980, Theor. Comput. Sci..

[4]  C.-C. Jay Kuo,et al.  Geometry-guided progressive lossless 3D mesh coding with octree (OT) decomposition , 2005, SIGGRAPH 2005.

[5]  Konrad Polthier,et al.  FreeLence ‐ Coding with Free Valences , 2005, Comput. Graph. Forum.

[6]  Insung Ihm,et al.  Wavelet‐Based 3D Compression Scheme for Interactive Visualization of Very Large Volume Data , 1999, Comput. Graph. Forum.

[7]  Martin Isenburg,et al.  Face fixer: compressing polygon meshes with properties , 2000, SIGGRAPH.

[8]  Jarek Rossignac,et al.  Edgebreaker: Connectivity Compression for Triangle Meshes , 1999, IEEE Trans. Vis. Comput. Graph..

[9]  Renato Pajarola,et al.  Out-Of-Core Algorithms for Scientific Visualization and Computer Graphics , 2002 .

[10]  Ingo Wald,et al.  Ray tracing deformable scenes using dynamic bounding volume hierarchies , 2007, TOGS.

[11]  Philip M. Hubbard,et al.  Interactive collision detection , 1993, Proceedings of 1993 IEEE Research Properties in Virtual Reality Symposium.

[12]  J. Mahovsky Ray tracing with reduced-precision bounding volume hierarchies , 2005 .

[13]  Pierre Alliez,et al.  Valence‐Driven Connectivity Encoding for 3D Meshes , 2001, Comput. Graph. Forum.

[14]  John F. Canny,et al.  Impulse-based simulation of rigid bodies , 1995, I3D '95.

[15]  David Zerling,et al.  Generating binary trees using rotations , 1985, JACM.

[16]  Ingo Wald,et al.  Realtime ray tracing and interactive global illumination , 2004, Ausgezeichnete Informatikdissertationen.

[17]  Abraham Silberschatz,et al.  Operating System Concepts , 1983 .

[18]  Christoforos E. Kozyrakis,et al.  A case for intelligent RAM , 1997, IEEE Micro.

[19]  Joseph S. B. Mitchell,et al.  Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998, IEEE Trans. Vis. Comput. Graph..

[20]  Alexander Reshetov,et al.  Multi-level ray tracing algorithm , 2005, ACM Trans. Graph..

[21]  Peter Lindstrom,et al.  Random-Accessible Compressed Triangle Meshes , 2007, IEEE Transactions on Visualization and Computer Graphics.

[22]  Paolo Cignoni,et al.  C‐BDAM – Compressed Batched Dynamic Adaptive Meshes for Terrain Rendering , 2006, Comput. Graph. Forum.

[23]  I. Wald,et al.  On fast Construction of SAH-based Bounding Volume Hierarchies , 2007, 2007 IEEE Symposium on Interactive Ray Tracing.

[24]  Flemming Friche Rodler Wavelet based 3D compression with fast random access for very large volume data , 1999, Proceedings. Seventh Pacific Conference on Computer Graphics and Applications (Cat. No.PR00293).

[25]  Didier Le Gall,et al.  MPEG: a video compression standard for multimedia applications , 1991, CACM.

[26]  Ming Tang,et al.  ReduceM: Interactive and Memory Efficient Ray Tracing of Large Models , 2008, Comput. Graph. Forum.

[27]  Dinesh Manocha,et al.  Ray-Strips: A Compact Mesh Representation for Interactive Ray Tracing , 2007, 2007 IEEE Symposium on Interactive Ray Tracing.

[28]  Parris K. Egbert,et al.  Lightweight Bounding Volumes for Ray Tracing , 2006, J. Graph. Tools.

[29]  Turner Whitted,et al.  A 3-dimensional representation for fast rendering of complex scenes , 1980, SIGGRAPH '80.

[30]  Lars Arge,et al.  Cache-Oblivious Data Structures , 2004 .

[31]  Gabriel Zachmann,et al.  Collision Detection for Deformable Objects , 2004, Comput. Graph. Forum.

[32]  Martin Isenburg,et al.  Out-of-core compression for gigantic polygon meshes , 2003, ACM Trans. Graph..

[33]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[34]  Ian H. Witten,et al.  Arithmetic coding revisited , 1998, TOIS.

[35]  Erkki Mäkinen,et al.  Tree Compression and Optimization with Applications , 1990, Int. J. Found. Comput. Sci..

[36]  Peter van Emde Boas,et al.  Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space , 1977, Inf. Process. Lett..

[37]  Pierre Alliez,et al.  Angle‐Analyzer: A Triangle‐Quad Mesh Codec , 2002, Comput. Graph. Forum.

[38]  David Salomon,et al.  Data Compression , 2000, Springer Berlin Heidelberg.

[39]  Martin Isenburg,et al.  Streaming meshes , 2005, VIS 05. IEEE Visualization, 2005..

[40]  Robert L. Cook,et al.  Distributed ray tracing , 1998 .

[41]  Gino van den Bergen Efficient Collision Detection of Complex Deformable Models using AABB Trees , 1997, J. Graphics, GPU, & Game Tools.

[42]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[43]  Sylvain Lefebvre,et al.  Perfect spatial hashing , 2006, SIGGRAPH 2006.

[44]  Wolfgang Straßer,et al.  Real time compression of triangle mesh connectivity , 1998, SIGGRAPH.

[45]  Dinesh Manocha,et al.  Collision and Proximity Queries , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[46]  Seungyong Lee,et al.  Multiresolution Random Accessible Mesh Compression , 2006, Comput. Graph. Forum.

[47]  D. Manocha,et al.  RT-DEFORM: Interactive Ray Tracing of Dynamic Scenes using BVHs , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[48]  Pierre Alliez,et al.  Recent advances in compression of 3D meshes , 2005, 2005 13th European Signal Processing Conference.

[49]  Olivier Devillers,et al.  Geometric compression for interactive transmission , 2000 .

[50]  Marc Levoy,et al.  QSplat: a multiresolution point rendering system for large meshes , 2000, SIGGRAPH.

[51]  Leif Kobbelt,et al.  Simplification and Compression of 3D Meshes , 2002, Tutorials on Multiresolution in Geometric Modelling.

[52]  P. Bekaert,et al.  The Quantized kd-Tree: Efficient Ray Tracing of Compressed Point Clouds , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[53]  Seungyong Lee,et al.  Random Accessible Mesh Compression Using Mesh Chartification , 2009, IEEE Transactions on Visualization and Computer Graphics.

[54]  I. Wald,et al.  On building fast kd-Trees for Ray Tracing, and on doing that in O(N log N) , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[55]  Dinesh Manocha,et al.  Cache‐Efficient Layouts of Bounding Volume Hierarchies , 2006, Comput. Graph. Forum.