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. © 2007 The Authors Journal compilation © 2007 The Eurographics Association and Blackwell Publishing Ltd.
Author supplied keywords
Cite
CITATION STYLE
Rodríguez, L., Navazo, I., & Vinacua, À. (2007). Data-driven tetrahedral mesh subdivision. Computer Graphics Forum, 26(4), 783–793. https://doi.org/10.1111/j.1467-8659.2007.01033.x
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.