View dependent isosurface extraction

We propose a new approach to polygonal isosurface extraction that is based on extracting only the visible portion of the isosurface. The visibility tests are done in two phases. First, coarse visibility tests are performed in software to determine the visible cells. These tests are based on hierarchical tiles and shear-warp factorization. The second phase resolves the visible portions of the extracted triangles and is accomplished by the graphics hardware. While the latest isosurface extraction methods have effectively eliminated the search phase bottleneck, the cost of constructing and rendering the isosurface remains high. Many of today's large datasets contain very large and complex isosurfaces that can easily overwhelm even state-of-the-art graphics hardware. The proposed approach is output sensitive and is thus well suited for remote visualization applications where the extraction and rendering phases are done on a separate machines.

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

[2]  Kyu Ho Park,et al.  A type-merging algorithm for extracting an isosurface from volumetric data , 2005, The Visual Computer.

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

[4]  Roni Yagel,et al.  Octree-based decimation of marching cubes surfaces , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

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

[6]  Tien-Tsin Wong,et al.  "Skeleton climbing": fast isosurfaces with fewer triangles , 1997, Proceedings The Fifth Pacific Conference on Computer Graphics and Applications.

[7]  Koji Koyamada,et al.  Isosurface generation by using extrema graphs , 1994, Proceedings Visualization '94.

[8]  Hans-Peter Bunge,et al.  Mantle Convection Visualization on the Cray T3D , 1996, IEEE Visualization.

[9]  W. Lorensen,et al.  Two algorithms for the three-dimensional reconstruction of tomograms. , 1988, Medical physics.

[10]  Han-Wei Shen,et al.  Sweeping simplices: a fast iso-surface extraction algorithm for unstructured grids , 1995, Proceedings Visualization '95.

[11]  Koji Koyamada,et al.  Volume thinning for automatic isosurface propagation , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[12]  Roberto Scopigno,et al.  Discretized Marching Cubes , 1994, Proceedings Visualization '94.

[13]  Robert Haimes,et al.  Advanced interactive visualization for CFD , 1990 .

[14]  Sergey V. Matveyev Approximation of isosurface in the Marching Cube: ambiguity problem , 1994, Proceedings Visualization '94.

[15]  Ned Greene,et al.  Hierarchical polygon tiling with coverage masks , 1996, SIGGRAPH.

[16]  Geoff Wyvill,et al.  Data structure forsoft objects , 1986, The Visual Computer.

[17]  M. Levoy,et al.  Fast volume rendering using a shear-warp factorization of the viewing transformation , 1994, SIGGRAPH.

[18]  Charles D. Hansen,et al.  Isosurfacing in span space with utmost efficiency (ISSUE) , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[19]  Peter-Pike J. Sloan,et al.  Interactive ray tracing for isosurface rendering , 1998 .