@chbaeh

Efficient Sparse Voxel Octrees

, and . Proceedings of the 2010 ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games, page 55--63. New York, NY, USA, ACM, (2010)

Abstract

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.

Description

Efficient sparse voxel octrees

Links and resources

DOI:
10.1145/1730804.1730814
URL:
BibTeX key:
Laine:2010:ESV:1730804.1730814
search on:

Comments and Reviews  
(0)

There is no review or comment yet. You can write one!

Tags


Cite this publication