Efficient isosurface extraction using marching tetrahedra and histogram pyramids on multiple GPUs

Authors:
Miłosz Ciżnicki;Michał Kierzynka;Krzysztof Kurowski;Bogdan Ludwiczak;Krystyna Napierała;Jarosław Palczyński
Affiliations:
Poznań Supercomputing and Networking Center, Poznań, Poland;Poznań Supercomputing and Networking Center, Poznań, Poland;Poznań Supercomputing and Networking Center, Poznań, Poland;Poznań Supercomputing and Networking Center, Poznań, Poland;Poznań Supercomputing and Networking Center, Poznań, Poland;Poznań Supercomputing and Networking Center, Poznań, Poland
Venue:
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II
Year:
2011

Citing 7
Cited 0

Marching cubes: A high resolution 3D surface construction algorithm

SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
An Evaluation of Implicit Surface Tilers

IEEE Computer Graphics and Applications
Hardware-Accelerated Reconstruction of Polygonal Isosurface Representations on Unstructured Grids

PG '04 Proceedings of the Computer Graphics and Applications, 12th Pacific Conference
Advanced interactive medical visualization on the GPU

Journal of Parallel and Distributed Computing
High-Quality Rendering of Varying Isosurfaces with Cubic Trivariate C1-Continuous Splines

ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I
GPU accelerated isosurface extraction on tetrahedral grids

ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part I
Isosurface computation made simple: hardware acceleration, adaptive refinement and tetrahedral stripping

VISSYM'04 Proceedings of the Sixth Joint Eurographics - IEEE TCVG conference on Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The algorithms for isosurface extraction have become crucial in petroleum industry, medicine and many other fields over the last years. Nowadays market demands engender a need for methods that not only construct accurate 3D models but also deal with the problem efficiently. Recently, a few highly optimized approaches taking advantage of modern graphics processing units (GPUs) have been published in the literature. However, despite their satisfactory speed, they all may be unsuitable in real-life applications due to limits on maximum domain size they can process. In this paper we present a novel approach to surface extraction by combining the algorithm of Marching Tetrahedra with the idea of Histogram Pyramids. Our GPU-based application can process CT and MRI scan data. Thanks to domain decomposition, the only limiting factor for the size of input instance is the amount of memory needed to store the resulting model. The solution is also immensely fast achieving up to 107-fold speedup comparing to a serial CPU code. Moreover, multiple GPUs support makes it very scalable. Provided tool enables the user to visualize generated model and to modify it in an interactive manner.