This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Marching Cubes without Skinny Triangles
March/April 2009 (vol. 11 no. 2)
pp. 82-87
Carlos E. Scheidegger, University of Utah
João L.D. Comba, Instituto de Informática, UFRGS
Luciana P. Nedel, Instituto de Informática, UFRGS
Cláudio T. Silva, University of Utah
Most computational codes that use irregular grids depend on the single worst triangle's quality: skinny triangles can lead to bad performance and numerical instabilities. Marching cubes (MC) is the standard isosurface grid generation algorithm, and, whereas most triangles it generates are good, it almost always generates some bad triangles. Here, we show how simple changes to MC can lead to a drastically reduced number of degenerate triangles, making it a more practical choice for isosurface grid generation, reducing or eliminating the need for and cost of postprocessing.

1. W.E. Lorensen and H.E. Cline, "Marching Cubes: A High Resolution 3D Surface Construction Algorithm, Proc. 14th Ann. Conf. Computer Graphics and Interactive Techniques (SIGGRAPH 87), ACM Press, 1987, pp. 163–169.
2. P.P. Pebay and T.J. Baker, "A Comparison of Triangle Quality Measures," Proc. 10th Int'l Meshing Roundtable, Sandia National Laboratories, 2001, pp. 327–340.
3. P. Alliez et al., Recent Advances in Remeshing of Surfaces, Springer-Verlag, 2008.
4. J. Schreiner, C. Scheidegger, and C. Silva, "High-Quality Extraction of Isosurfaces from Regular and Irregular Grids," IEEE Trans. Visualization and Computer Graphics, vol. 12, no. 5,IEEE CS Press, 2006, pp. 1205–1212.
5. C. Dietrich et al., "Edge Groups: An Approach to Understanding the Mesh Quality of Marching Methods," IEEE CS Trans. Visualization and Computer Graphics, vol. 14, no. 6,IEEE CS Press, 2008, pp. 1651–1658.
6. C. Dietrich et al., "Edge Transformations for Improving Mesh Quality of Marching Cubes," IEEE CS Trans. Visualization and Computer Graphics, IEEE CS Press, vol. 15, no. 1, 2009, pp. 150–159.
7. J.R. Shewchuk, "What is a Good Linear Element? Interpolation, Conditioning, and Quality Measures," Proc. 11th Int'l Meshing Roundtable, 2002, pp. 115–126.
8. T. Lewiner et al., "Efficient Implementation of Marching Cubes Cases with Topological Guarantees," J. Graphics Tools, vol. 8, no. 2, 2003, pp. 1–15.
9. G.M. Nielson, "Dual Marching Cubes," Proc. Conf. Visualization (VIS 04), IEEE CS Press, 2004, pp. 489–496.
10. C. Montani, R. Scateni, and R. Scopigno, "Discretized Marching Cubes," Proc. Conf. Visualization (VIS 94), IEEE CS Press, 1994, pages 281–287.

Index Terms:
Isosurfacing, marching cubes, numerical simulation, visualization corner
Citation:
Carlos A. Dietrich, Carlos E. Scheidegger, João L.D. Comba, Luciana P. Nedel, Cláudio T. Silva, "Marching Cubes without Skinny Triangles," Computing in Science and Engineering, vol. 11, no. 2, pp. 82-87, March-April 2009, doi:10.1109/MCSE.2009.34
Usage of this product signifies your acceptance of the Terms of Use.