Data-driven Tetrahedral Mesh Subdivision
Abstract
Given a tetrahedral mesh immersed in a voxel model, we present a method to refine the mesh to reduce the discrepancy between interpolated values based on either scheme at arbitrary locations. An advantage of the method presented is that it requires few subdivisions and all decisions are made locally at each tetrahedron. We discuss the algorithm s performance and applications.
BibTeX
@article {10.1111:j.1467-8659.2007.01033.x,
journal = {Computer Graphics Forum},
title = {{Data-driven Tetrahedral Mesh Subdivision}},
author = {Rodriguez, L. and Navazo, I. and Vinacua, A.},
year = {2007},
publisher = {The Eurographics Association and Blackwell Publishing Ltd},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.2007.01033.x}
}
journal = {Computer Graphics Forum},
title = {{Data-driven Tetrahedral Mesh Subdivision}},
author = {Rodriguez, L. and Navazo, I. and Vinacua, A.},
year = {2007},
publisher = {The Eurographics Association and Blackwell Publishing Ltd},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.2007.01033.x}
}