L. Custódio, S. Pesco, C. Silva

The Marching Cubes algorithm is arguably the most popular isosurface extraction algorithm. Since its inception, two problems have lingered, namely, triangle quality and topology correctness. Although there is an extensive literature to solve them, topology correctness is achieved in detriment of triangle quality and vice-versa. In this paper we present an extended version of the Marching Cubes 33 algorithm (a variation of the Marching Cubes algorithm which guarantees topological correctness), called Extended Marching Cubes 33. In the proposed algorithm the grid vertex are labeled with “+”, “-” and “=”, according to the relationship between its scalar field value and the isovalue. The inclusion of the “=” grid vertex label naturally avoids degenerate triangles. As an application of our method, we use the proposed triangulation to improve the quality of the triangles in the generated mesh while preserving its topology as much as possible.

In this work, to better represent our results, we made our figures executable. This project page presents the interactive version os the figures of the paper. The interactive figures can also be acessed by clicking on the figures of the pdf version of the work.

Supplemental material

[Paper Figure 2] [Paper Figure 3] [Paper Figure 4] [Paper Figure 5] [Paper Figure 6] [Paper Figure 7] [Paper Figure 9] [Paper Figure 10]
[Paper Figure 11] [Paper Figure 12] [Paper Figure 13] [Paper Figure 14] [Paper Figure 15] [Paper Figure 16] [Paper Figure 20] [Paper Figure 21]


[Marching Cubes cases] [Randomly generated grids]