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 language | English (US) |
---|---|
Article number | 4784402 |
Pages (from-to) | 82-87 |
Number of pages | 6 |
Journal | Computing in Science and Engineering |
Volume | 11 |
Issue number | 2 |
DOIs | |
State | Published - Mar 2009 |
Externally published | Yes |
Keywords
- Isosurfacing
- Marching cubes
- Numerical simulation
- Visualization corner
ASJC Scopus subject areas
- General Computer Science
- General Engineering