Using ray intersection for dual isosurfacing

Isosurface extraction using “dual contouring” approaches have been developed to generate a surface that is “dual” in terms of the underlying extraction procedure used when compared to the standard Marching Cubes (MC) method. These approaches address some shortcomings of the MC methods including feature-detection within a cell and better triangles. One approach for preserving “sharp features” within a cell is to determine isosurface points inside each cell by minimizing a quadric error functions (QEF). However, this category of methods is constrained in certain respects such as finding just one isosurface point per cell or requiring Hermite data to calculate an isosurface. We present a simple method based on the MC method and the ray intersection technique to compute isosurface points in the cell interior. One of the advantages of our method is that it does not require Hermite data, i.e., the discrete scalar values at vertices suffice. We compute ray intersections to determine isosurface points in the interior of each cell, and then perform a complete analysis of all possible configurations to generate a look-up table for all configurations. Since complex features (e.g., tunnels) tend to be undersampled with “dual” points sufficient to represent sharp features and disjoint surfaces within the cell, we use the look-up table to optimize the ray intersection method to obtain minimum number of points necessarily sufficient for defining topologically correct isosurfaces in all possible configurations. Isosurface points are connected using a simple strategy.

[1]  E Chernyaev,et al.  Marching cubes 33 : construction of topologically correct isosurfaces , 1995 .

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

[3]  Gregory M. Nielson,et al.  On Marching Cubes , 2003, IEEE Trans. Vis. Comput. Graph..

[4]  W. Press,et al.  Numerical Recipes: The Art of Scientific Computing , 1987 .

[5]  Reinhard Klein,et al.  Efficient representation and extraction of 2-manifold isosurfaces using kd-trees , 2004, Graph. Model..

[6]  Mario Botsch,et al.  Feature sensitive surface extraction from volume data , 2001, SIGGRAPH.

[7]  Tao Ju,et al.  Dual contouring of hermite data , 2002, ACM Trans. Graph..

[8]  R. Nickalls A new approach to solving the cubic: Cardan’s solution revealed , 1993, The Mathematical Gazette.

[9]  Sarah Gibson Constrained Elastic Surface Nets: Generating Smooth Surfaces from Binary Segmented Data , 1998 .

[10]  Bernd Hamann,et al.  Iso-splatting: a point-based alternative to isosurface visualization , 2003, 11th Pacific Conference onComputer Graphics and Applications, 2003. Proceedings..

[11]  Scott Schaefer,et al.  Dual marching cubes: primal contouring of dual grids , 2004, 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings..

[12]  Bernd Hamann,et al.  The asymptotic decider: resolving the ambiguity in marching cubes , 1991, Proceeding Visualization '91.

[13]  Ken Brodlie,et al.  Improving the Robustness and Accuracy of the Marching Cubes Algorithm for Isosurfacing , 2003, IEEE Trans. Vis. Comput. Graph..

[14]  Gregory M. Nielson,et al.  Dual marching cubes , 2004, IEEE Visualization 2004.

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

[16]  Reinhard Klein,et al.  Efficient representation and extraction of 2-manifold isosurfaces using kd-trees , 2003, 11th Pacific Conference onComputer Graphics and Applications, 2003. Proceedings..