Adaptative Cubical Grid for Isosurface Extraction
Egileak: John Edgar Congote and Aitor Moreno and Iñigo Barandiaran and Javier Barandiaran and O. Ruiz
Data: 05.02.2009
Abstract
This work proposes a variation on the Marching Cubes algorithm, where the goal is to represent implicit functions with higher resolution and better graphical quality 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 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 discretization process using the original grid.
BIB_text
@Article {
author = {John Edgar Congote and Aitor Moreno and Iñigo Barandiaran and Javier Barandiaran and O. Ruiz},
title = {Adaptative Cubical Grid for Isosurface Extraction},
pages = {21-26},
abstract = {
This work proposes a variation on the Marching Cubes algorithm, where the goal is to represent implicit functions with higher resolution and better graphical quality 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 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 discretization process using the original grid.
}
isbn = {978-989-8111-67-8},
date = {2009-02-05},
year = {2009},
}
author = {John Edgar Congote and Aitor Moreno and Iñigo Barandiaran and Javier Barandiaran and O. Ruiz},
title = {Adaptative Cubical Grid for Isosurface Extraction},
pages = {21-26},
abstract = {
This work proposes a variation on the Marching Cubes algorithm, where the goal is to represent implicit functions with higher resolution and better graphical quality 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 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 discretization process using the original grid.
}
isbn = {978-989-8111-67-8},
date = {2009-02-05},
year = {2009},
}
