High-speed Marching Cubes using HistoPyramids

Authors: Dyken, Christopher; Ziegler, Gernot¹; Theobalt, Christian²; Seidel, Hans-Peter¹

Source: Computer Graphics Forum, Volume 27, Number 8, December 2008 , pp. 2028-2039(12)

Buy & download fulltext article:

Price: $48.00 plus tax (Refund Policy)

Abstract:

We present an implementation approach for Marching Cubes (MC) on graphics hardware for OpenGL 2.0 or comparable graphics APIs. It currently outperforms all other known graphics processing units (GPU)-based iso-surface extraction algorithms in direct rendering for sparse or large volumes, even those using the recently introduced geometry shader (GS) capabilites. To achieve this, we outfit the Histogram Pyramid (HP) algorithm, previously only used in GPU data compaction, with the capability for arbitrary data expansion. After reformulation of MC as a data compaction and expansion process, the HP algorithm becomes the core of a highly efficient and interactive MC implementation. For graphics hardware lacking GSs, such as mobile GPUs, the concept of HP data expansion is easily generalized, opening new application domains in mobile visual computing. Further, to serve recent developments, we present how the HP can be implemented in the parallel programming language CUDA (compute unified device architecture), by using a novel 1D chunk/layer construction.

Keywords: volume processing; marching cubes; real-time; GPU; GPGPU; histopyramids; OpenGL; gather-only; data expansion; geometry shader; I.3.5 [Computer Graphics]: Computational Geometry and Object Modelling; I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism

Document Type: Research article

DOI: http://dx.doi.org/10.1111/j.1467-8659.2008.01182.x

Affiliations: 1: Max-Planck-Institut für Informatik, Germany 2: Max Planck Center for Visual Computing and Communication, Stanford University, Palo Alto, CA, USA

Publication date: 2008-12-01