Sciweavers

Share
I3D
2010
ACM

Efficient Sparse Voxel Octrees

9 years 2 months ago
Efficient Sparse Voxel Octrees
In this paper we examine the possibilities of using voxel representations as a generic way for expressing complex and feature-rich geometry on current and future GPUs. We present in detail a compact data structure for storing voxels and an efficient algorithm for performing ray casts using this structure. We augment the voxel data with novel contour information that increases geometric resolution, allows more compact encoding of smooth surfaces, and accelerates ray casts. We also employ a novel normal compression format for storing high-precision object-space normals. Finally, we present a variable-radius post-process filtering technique for smoothing out blockiness caused by discrete sampling of shading attributes. Our benchmarks show that our voxel representation is competitive with triangle-based representations in terms of ray casting performance, while allowing tremendously greater geometric detail and unique shading information for every voxel.
Samuli Laine, Tero Karras
Added 02 Mar 2010
Updated 02 Mar 2010
Type Conference
Year 2010
Where I3D
Authors Samuli Laine, Tero Karras
Comments (0)
books