dc.contributor.author | Velasco, Francisco | en_US |
dc.contributor.author | Torres, Juan Carlos | en_US |
dc.contributor.author | Cano, Pedro | en_US |
dc.contributor.editor | Xavier Pueyo | en_US |
dc.contributor.editor | Manuel Próspero dos Santos | en_US |
dc.contributor.editor | Luiz Velho | en_US |
dc.date.accessioned | 2023-01-24T14:15:55Z | |
dc.date.available | 2023-01-24T14:15:55Z | |
dc.date.issued | 2022 | |
dc.identifier.isbn | 978-3-03868-194-6 | |
dc.identifier.uri | https://doi.org/10.2312/pt.20021414 | |
dc.identifier.uri | https://diglib.eg.org:443/handle/10.2312/pt20021414 | |
dc.description.abstract | Volumetric data can be represented as a rectilinear structured grid and can be displayed by the rendering of an isosurface that is built from the grid and defining a threshold value. The know marching cubes method builds the isosurface cell by cell. However, from a set of cells that comply with some conditions, a bigger cell can be built. ln these cases, the volume is represented by a set of cells of different size. Then, the isosurface built by marching cubes will have holes on the borders between cells of different size. ln this paper, we show a new method, called marching edges, to build the isosurface edge by edge, that generates a hole-free isosurface. | en_US |
dc.publisher | The Eurographics Association | en_US |
dc.rights | Attribution 4.0 International License | |
dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
dc.subject | Volume visualization, Cell Octree, Marching Cubes, lsosurface extraction without cracks, Triangulation | |
dc.subject | Volume visualization | |
dc.subject | Cell Octree | |
dc.subject | Marching Cubes | |
dc.subject | lsosurface extraction without cracks | |
dc.subject | Triangulation | |
dc.title | Marching Edges: A Method for lsosurface Extraction | en_US |
dc.description.seriesinformation | SIACG2002 - 1st lbero-American Symposium in Computer Graphics | |
dc.description.sectionheaders | Visualization | |
dc.identifier.doi | 10.2312/pt.20021414 | |
dc.identifier.pages | 199-208 | |
dc.identifier.pages | 10 pages | |