Marching cubes without skinny triangles

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

Research output: Contribution to journalArticle

13 Scopus citations

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.

Original languageEnglish (US)
Article number4784402
Pages (from-to)82-87
Number of pages6
JournalComputing in Science and Engineering
Volume11
Issue number2
DOIs
StatePublished - Mar 1 2009
Externally publishedYes

Keywords

  • Isosurfacing
  • Marching cubes
  • Numerical simulation
  • Visualization corner

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Fingerprint Dive into the research topics of 'Marching cubes without skinny triangles'. Together they form a unique fingerprint.

  • Cite this

    Dietrich, C. A., Scheidegger, C. E., Comba, J. L. D., Nedel, L. P., & Silva, C. T. (2009). Marching cubes without skinny triangles. Computing in Science and Engineering, 11(2), 82-87. [4784402]. https://doi.org/10.1109/MCSE.2009.34