Issue No. 02 - March/April (2009 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MCSE.2009.34
Carlos A. Dietrich , Dell
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.
Isosurfacing, marching cubes, numerical simulation, visualization corner
C. T. Silva, J. L. Comba, C. E. Scheidegger, L. P. Nedel and C. A. Dietrich, "Marching Cubes without Skinny Triangles," in Computing in Science & Engineering, vol. 11, no. , pp. 82-87, 2009.