Extending Marching Cubes with Adaptative Methods to obtain more accurate iso-surfaces


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


Palabras clave


@incollection{2010_Congote_Extending, year={2010}, isbn={978-3-642-11839-5}, booktitle={Computer Vision, Imaging and Computer Graphics. Theory and Applications}, volume={68}, series={Communications in Computer and Information Science}, editor={Ranchordas, A. and Pereira, J. and Araujo, H. and Tavares, J.}, doi={10.1007/978-3-642-11840-1_3}, title={Extending Marching Cubes with Adaptative Methods to Obtain More Accurate Iso-surfaces}, url={http://dx.doi.org/10.1007/978-3-642-11840-1_3}, publisher={Springer Berlin Heidelberg}, author={Congote, John and Moreno, Aitor and Barandiaran, Inigo and Barandiaran, Javier and Ruiz, Oscar}, pages={35-44}, language={English} }