Documento de conferencia · 2010
Extending marching cubes with adaptative methods to obtain more accurate iso-surfaces
Record only. The repository marks this work as “None”: the PDF is not public, so there is no text to read here. View the record in the repository.
Abstract
This work proposes an extension of the Marching Cubes algorithm, where the goal is to represent implicit functions with higher accuracy using the same grid size. The proposed algorithm displaces the vertices of the cubes iteratively until the stop condition is achieved. After each iteration, the difference between the implicit and the explicit representations is reduced, and when the algorithm finishes, the implicit surface representation using the modified cubical grid is more accurate, as the results shall confirm. The proposed algorithm corrects some topological problems that may appear in the discretization process using the original grid. © 2010 Springer-Verlag Berlin Heidelberg.