The Community for Technology Leaders
Green Image
Issue No. 02 - March/April (2009 vol. 11)
ISSN: 1521-9615
pp: 82-87
Cláudio T. Silva , University of Utah
João L.D. Comba , Instituto de Informática, UFRGS
Carlos E. Scheidegger , University of Utah
Luciana P. Nedel , Instituto de Informática, UFRGS
ABSTRACT
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.
INDEX TERMS
Isosurfacing, marching cubes, numerical simulation, visualization corner
CITATION
Cláudio T. Silva, João L.D. Comba, Carlos E. Scheidegger, Luciana P. Nedel, Carlos A. Dietrich, "Marching Cubes without Skinny Triangles", Computing in Science & Engineering, vol. 11, no. , pp. 82-87, March/April 2009, doi:10.1109/MCSE.2009.34
207 ms
(Ver 3.3 (11022016))