An extended triangulation to the Marching Cubes 33 algorithm

Brazilian Computer Society. Journal

article

Lis Custodio¹  Sinesio Pesco²  Claudio Silva³ 

[1] Computational Modeling Department, Polytechnic Institute at the Rio de Janeiro State University;Department of Mathematics, Pontificial Catholic University of Rio de Janeiro;Computer Science and Engineering Department, New York University

关键词: Isosurface extraction;    Marching Cubes 33;    Mesh quality;    Extended lookup table;   

DOI  :  10.1186/s13173-019-0086-6

来源: Springer U K

【 摘 要 】

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.

【 授权许可】

Unknown