Data-driven Tetrahedral Mesh Subdivision

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. Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling

• Type: Journal
• Year: 2007
• Where: CGF
• Authors: L. Rodriguez, Isabel Navazo, Alvar Vinacua
• Keywords: Arbitrary Locations, CGF 2007, Tetrahedral Mesh, Voxel Model