The Quantized kd-Tree: Efficient Ray Tracing of Compressed Point Clouds
Citations Over TimeTop 10% of 2006 papers
Abstract
Both ray tracing and point-based representations provide means to efficiently display very complex 3D models. Computational efficiency has been the main focus of previous work on ray tracing point-sampled surfaces. For very complex models efficient storage in the form of compression becomes necessary in order to avoid costly disk access. However, as ray tracing requires neighborhood queries, existing compression schemes cannot be applied because of their sequential nature. This paper introduces a novel acceleration structure called the quantized kd-tree, which offers both efficient traversal and storage. The gist of our new representation lies in quantizing the kd-tree splitting plane coordinates. We show that the quantized kd-tree reduces the memory footprint up to 18 times, not compromising performance. Moreover, the technique can also be employed to provide LOD (level-of-detail) to reduce aliasing problems, with little additional storage cost
Related Papers
- → Recent improvements in beam tracing(2004)1 cited
- → 3D Ray Tracing Algorithm about Arbitrarily Shaped Particles Based on Triangular Patches(2009)
- Application of Pre-tracing Technology in Building of RCS Calculation Platform(2007)
- → A Fast Ray Tracing Method in Phase Space(2017)
- Phase space ray tracing for a two-dimensional parabolic reflector(2017)