Selective Refinement on Nested Tetrahedral Meshes

摘要: We consider a multi-resolution representation based on decomposition of the field domain into nested tetrahedral cells generated by recursive tetrahedron bisection, that we call Hierarchy Tetrahedra (HT) describe our implementation an HT, and discuss how to extract conforming meshes from HT so as avoid discontinuities in approximation associated scalar field. algorithms for selective refinement, which either variable-resolution mesh scratch through depth-first, or priority-based traversal technique, locally refine coarsen previously-extracted adaptive incremental approach. show experimental results connection with set basic queries performing analysis visualization volume data at different levels detail.