Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Journal Article

High-speed Marching Cubes using HistoPyramids


Ziegler,  Gernot
Computer Graphics, MPI for Informatics, Max Planck Society;


Theobalt,  Christian       
Computer Graphics, MPI for Informatics, Max Planck Society;


Seidel,  Hans-Peter       
Computer Graphics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Ziegler, G., Theobalt, C., Seidel, H.-P., & Dyken, C. (2008). High-speed Marching Cubes using HistoPyramids. Computer Graphics Forum, 27(8), 2028-2039. doi:10.1111/j.1467-8659.2008.01182.x.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1BDD-5
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