Marching cubes without skinny triangles

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

Research output: Contribution to journalArticle

13 Citations (Scopus)

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 2009
Externally publishedYes

Fingerprint

Costs

Keywords

  • Isosurfacing
  • Marching cubes
  • Numerical simulation
  • Visualization corner

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

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

Marching cubes without skinny triangles. / Dietrich, Carlos A.; Scheidegger, Carlos Eduardo; Comba, João L D; Nedel, Luciana P.; Silva, Cláudio T.

In: Computing in Science and Engineering, Vol. 11, No. 2, 4784402, 03.2009, p. 82-87.

Research output: Contribution to journalArticle

Dietrich, CA, Scheidegger, CE, Comba, JLD, Nedel, LP & Silva, CT 2009, 'Marching cubes without skinny triangles', Computing in Science and Engineering, vol. 11, no. 2, 4784402, pp. 82-87. https://doi.org/10.1109/MCSE.2009.34
Dietrich, Carlos A. ; Scheidegger, Carlos Eduardo ; Comba, João L D ; Nedel, Luciana P. ; Silva, Cláudio T. / Marching cubes without skinny triangles. In: Computing in Science and Engineering. 2009 ; Vol. 11, No. 2. pp. 82-87.
@article{c48179a30b3147cca8ac58e636217234,
title = "Marching cubes without skinny triangles",
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.",
keywords = "Isosurfacing, Marching cubes, Numerical simulation, Visualization corner",
author = "Dietrich, {Carlos A.} and Scheidegger, {Carlos Eduardo} and Comba, {Jo{\~a}o L D} and Nedel, {Luciana P.} and Silva, {Cl{\'a}udio T.}",
year = "2009",
month = "3",
doi = "10.1109/MCSE.2009.34",
language = "English (US)",
volume = "11",
pages = "82--87",
journal = "Computing in Science and Engineering",
issn = "1521-9615",
publisher = "IEEE Computer Society",
number = "2",

}

TY - JOUR

T1 - Marching cubes without skinny triangles

AU - Dietrich, Carlos A.

AU - Scheidegger, Carlos Eduardo

AU - Comba, João L D

AU - Nedel, Luciana P.

AU - Silva, Cláudio T.

PY - 2009/3

Y1 - 2009/3

N2 - 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.

AB - 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.

KW - Isosurfacing

KW - Marching cubes

KW - Numerical simulation

KW - Visualization corner

UR - http://www.scopus.com/inward/record.url?scp=60849089898&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=60849089898&partnerID=8YFLogxK

U2 - 10.1109/MCSE.2009.34

DO - 10.1109/MCSE.2009.34

M3 - Article

AN - SCOPUS:60849089898

VL - 11

SP - 82

EP - 87

JO - Computing in Science and Engineering

JF - Computing in Science and Engineering

SN - 1521-9615

IS - 2

M1 - 4784402

ER -