Sporala red del conocimiento
EN
Universidad EAFIT

Documento de conferencia · 2009

Adaptative cubical grid forisosurface extraction

Solo ficha. El repositorio marca este trabajo como «None»: el PDF no es público, así que aquí no hay texto para leer. Ver la ficha en el repositorio.

Resumen

This work proposes a variation on the Marching Cubes algorithm, where the goal is to represent implicit functions with higher resolution and better graphical qualiry 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 betvveen the implicit and the explicit representations are reduced, and when the algorithm finishes, the implicit surface representation using the modified cubical grid is more detailed, as the results shall confirm. The proposed algorithm corrects some topological problems that may appear in the discretisation process using the original grid.

Palabras clave