GPU Accelerated Isosurface Extraction on Tetrahedral Grids

Visualizing large unstructured grids is extremely useful to understand natural and simulated phenomena. However, informative volume visualization is difficult to achieve efficiently due to the huge amount of information to process. In this paper, we present a method to efficiently tessellate on a GPU large unstructured tetrahedral grids made of millions of cells. This method avoids data redundancy by using textures for storing most of the needed data; textures are accessed through vertex texture lookup in the vertex shading unit of modern graphics cards. Results show that our method is about 2 times faster than the same CPU-based extraction, and complementary with previous approaches based on GPU registers: it is less efficient for small grids, but handles millions-tetrahedra grids in graphics memory, which was impossible with previous works. Future hardware evolutions are expected to make our approach much more efficient.

[1]  J. Wilhelms,et al.  Octrees for faster isosurface generation , 1992, TOGS.

[2]  Jules Bloomenthal,et al.  Polygonization of implicit surfaces , 1988, Comput. Aided Geom. Des..

[3]  Guillaume Caumon,et al.  Circular incident edge lists: a data structure for rendering complex unstructured grids , 2001, Proceedings Visualization, 2001. VIS '01..

[4]  Joseph S. B. Mitchell,et al.  The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids , 1997, IEEE Trans. Vis. Comput. Graph..

[5]  Han-Wei Shen,et al.  A Near Optimal Isosurface Extraction Algorithm Using the Span Space , 1996, IEEE Trans. Vis. Comput. Graph..

[6]  Peter Shirley,et al.  A polygonal approximation to direct scalar volume rendering , 1990, SIGGRAPH 1990.

[7]  V. Pascucci,et al.  Isosurface computation made simple: hardware acceleration, adaptive refinement and tetrahedral stripping , 2004, VISSYM'04.

[8]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[9]  Edward M. McCreight,et al.  Priority Search Trees , 1985, SIAM J. Comput..

[10]  Marc J. van Kreveld,et al.  Efficient Methods for Isoline Extraction from a TIN , 1996, Int. J. Geogr. Inf. Sci..

[11]  Bruno Lévy,et al.  VolumeExplorer: roaming large volumes to couple visualization and data processing for oil and gas exploration , 2005, VIS 05. IEEE Visualization, 2005..

[12]  Simon Stegmaier,et al.  Hardware-accelerated reconstruction of polygonal isosurface representations on unstructured grids , 2004, 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings..

[13]  Martin Kraus,et al.  High-quality pre-integrated volume rendering using hardware-accelerated pixel shading , 2001, HWWS '01.

[14]  Paolo Cignoni,et al.  Speeding Up Isosurface Extraction Using Interval Trees , 1997, IEEE Trans. Vis. Comput. Graph..

[15]  Peter Kipfer GPU Construction and Transparent Rendering of Iso-Surfaces , 2005 .

[16]  Guillaume Caumon,et al.  Visualization of grids conforming to geological structures: a topological approach , 2005, Comput. Geosci..

[17]  Valerio Pascucci,et al.  Fast isocontouring for improved interactivity , 1996, VVS '96.

[18]  Günther Greiner,et al.  Realtime Isosurface Extraction with Graphics Hardware , 2004, Eurographics.

[19]  Valerio Pascucci,et al.  Contour trees and small seed sets for isosurface traversal , 1997, SCG '97.