Marching Cubes without Skinny Triangles

  • Authors:
  • Carlos A. Dietrich;Carlos E. Scheidegger;João L. D. Comba;Luciana P. Nedel;Cláudio T. Silva

  • Affiliations:
  • Dell;University of Utah;Instituto de Informática, UFRGS;Instituto de Informática, UFRGS;University of Utah

  • Venue:
  • Computing in Science and Engineering
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.