Bisecting with optimal similarity bound on 3D unstructured conformal meshes

Abstract

We propose a new method to mark for bisection the edges of an arbitrary 3D unstructured conformal mesh. For these meshes, the approach conformingly marks all the tetrahedra with coplanar edge marks. To this end, the method needs three key ingredients. First, we propose a specific edge ordering. Second, marking with this ordering, we guarantee that the mesh becomes conformingly marked. Third, we also ensure that all the marks are coplanar in each tetrahedron. To demonstrate the marking method, we implement an existent marked bisection approach. Using this implementation, we mark and then locally refine 3D unstructured conformal meshes. We conclude that the resulting marked bisection features an optimal bound of similarity classes per tetrahedron.