2021-04-162010-01-011865092918650937WOS;000288734300003SCOPUS;2-s2.0-77957599273http://hdl.handle.net/10784/29482This 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.enghttps://v2.sherpa.ac.uk/id/publication/issn/1865-0929info:eu-repo/semantics/conferencePaperDiscretization processExplicit representationGrid sizeImplicit functionImplicit surface representationIso surfaceMarching cubeMarching Cubes algorithmComputer graphicsComputer visionGeometryIterative methodsTopologyAlgorithms2021-04-16Congote, J.Moreno, A.Barandiaran, I.Barandiaran, J.Ruiz, O.10.1007/978-3-642-11840-1_3