This Article 
 Bibliographic References 
 Add to: 
Fast Isosurface Generation Using the Volume Thinning Algorithm
January-March 2001 (vol. 7 no. 1)
pp. 32-46

Abstract—One of the most effective techniques for developing efficient isosurfacing algorithms is the reduction of visits to nonisosurface cells. Recent algorithms have drastically reduced the unnecessary cost of visiting nonisosurface cells. The experimental results show almost optimal performance in their isosurfacing processes. However, most of them have a bottleneck in that they require more than $O(n)$ computation time for their preprocessing, where $n$ denotes the total number of cells. In this paper, we propose an efficient isosurfacing technique, which can be applied to unstructured as well as structured volumes and which does not require more than $O(n)$ computation time for its preprocessing. A preprocessing step generates an extrema skeleton, which consists of cells and connects all extremum points, by the volume thinning algorithm. All disjoint parts of every isosurface intersect at least one cell in the extrema skeleton. Our implementation generates isosurfaces by searching for isosurface cells in the extrema skeleton and then recursively visiting their adjacent isosurface cells, while it skips most of the nonisosurface cells. The computation time of the preprocessing is estimated as $O(n)$. The computation time of the isosurfacing process is estimated as $O(n^{1/3} m + k)$, where $k$ denotes the number of isosurface cells and $m$ denotes the number of extremum points since the number of cells in an extrema skeleton is estimated as $O(n^{1/3} m)$.

[1] W.E. Lorensen and H.E. Cline, “Marching Cubes: A High Resolution 3D Surface Construction Algorithm,” Computer Graphics (SIGGRAPH '87 Proc.), vol. 21, pp. 163-169, 1987.
[2] A. Doi and A. Koide, “An Efficient Method of Triangulating Equi-Valued Surfaces by Using Tetrahedral Cells,” IEICE Trans., vol. E74, no. 1, pp. 214-224, 1991.
[3] C.D. Hansen and P. Hinker, “Massively Parallel Isosurface Extraction,” Proc. IEEE Visualization '92, pp. 77-83, 1992.
[4] C.T. Howie and E.H. Blake, “The Mesh Propagation Algorithm for Isosurface Construction,” Computer Graphics Forum (Eurographics), vol. 13, no. 3, pp. C-65-74, 1994.
[5] J.W. Durkin and J.F. Hughes, “Nonpolygonal Isosurface Rendering for Large Volume,” Proc. IEEE Visualization '94, pp. 293-300, 1994.
[6] R.S. Gallagher, “Span Filtering: An Optimization Scheme for Volume Visualization of Large Finite Element Models,” Proc. IEEE Visualization '91, pp. 68-74, 1991.
[7] M. Giles and R. Haimes, “Advanced Interactive Visualization for CFD,” Computer Systems in Eng., vol. 1, no. 1, pp. 51-62, 1990.
[8] H. Shen and C.R. Johnson, “Sweeping Simplices: A Fast Iso-Surface Extraction Algorithm for Unstructured Grids,” Proc. IEEE Visualization '95, pp. 143-150, 1995.
[9] J. Wilhelms and A. Van Gelder, "Octrees for Faster Isosurface Generation," ACM Trans. Graphics, vol. 11, no. 3, July 1992, pp. 201-227.
[10] D. Silver and N.J. Zabusky, “Quantifying Visualization for Reduced Modeling in Nonlinear Science: Extracting Structures from Data Sets,” J. Visual Comm. and Image Representation, vol. 4, no. 1, pp. 46-61, 1993.
[11] Y. Livnat, H. Shen, and C.R. Johnson, "A Near Optimal Isosurface Extraction Algorithm Using the Span Space," IEEE Trans. Visualization and Computer Graphics, vol. 2, no. 1, Mar. 1996, pp. 73-84.
[12] H. Shen, C.D. Hansen, Y. Livnat, and C.R. Johnson, “Isosurfacing in Span Space with Utmost Efficiency (ISSUE),” Proc. IEEE Visualization '96, pp. 287-294, 1996.
[13] P. Cignoni, P. Marino, C. Montani, E. Puppo, and R. Scopigno, “Speeding Up Isosurface Extraction Using Interval Trees,” IEEE Trans. Visualization and Computer Graphics, vol. 3, no. 2, pp. 158-170, Apr.-June 1997.
[14] T. Itoh and K. Koyamada, “Automatic Isosurface Propagation by Using an Extrema Graph and Sorted Boundary Cell Lists,” IEEE Trans. Visualization and Computer Graphics, vol. 1, no. 4, pp. 319-327, Dec. 1995.
[15] T. Itoh, Y. Yamaguchi, and K. Koyamada, “Volume Thinning for Automatic Isosurface Propagation,” Proc. IEEE Visualization '96, pp. 303-310, 1996.
[16] C.L. Bajaj, V. Pascucci, and D.R. Schikore, “Fast Isocontouring for Improved Interactivity,” Proc. ACM Symp. Volume Visualization '96, 1996.
[17] M. Kreveld, R. Oostrum, C.L. Bajaj, V. Pascucci, and D.R. Schikore, “Contour Trees and Small Seed Sets for Isosurface Traversal,” Proc. 13th ACM Symp. Computational Geometry, pp. 212-219, 1997.
[18] G. Wyvill, C. McPheeters, and B. Wyvill, “Data Structure for Soft Objects,” The Visual Computer, vol. 2, no. 4, pp. 227-234, 1986.
[19] J. Bloomenthal, “Polygonization of Implicit Surfaces,” Computer Aided Geometric Design, vol. 5, no. 4, pp. 341-355, 1988.
[20] D. Speray and S. Kennon, “Volume Probe: Interactive Data Exploration on Arbitrary Grids,” Computer Graphics, vol. 24, no. 5, pp. 5-12, 1990.
[21] C.L. Bajaj, V. Pascucci, and D.R. Schikore, “Visualization of Scalar Topology for Structural Enhancement,” Proc. IEEE Visualization '98, pp. 51-58, 1998.
[22] J.R. Munkres, Topology: A First Course. Prentice Hall, 1975.
[23] T. Pavlidis, Algorithms for Graphics and Image Processing, pp. 199-201 Rockville, Md.: Computer Science Press, 1982.

Index Terms:
Isosurface, extremum points, volume thinning, extrema skeleton, lattice classification.
Takayuki Itoh, Yasushi Yamaguchi, Koji Koyamada, "Fast Isosurface Generation Using the Volume Thinning Algorithm," IEEE Transactions on Visualization and Computer Graphics, vol. 7, no. 1, pp. 32-46, Jan.-March 2001, doi:10.1109/2945.910819
Usage of this product signifies your acceptance of the Terms of Use.