Conforming Post-Refinement of Non-Mathching Tetrahedral Meshes
نویسندگان
چکیده
In this note we propose a post-refinement technique, which can be used to provide the overall conformity of two different tetrahedral meshes meeting at the planar interface. The algorithm also applies to the case where the boundary triangulation of the existing tetrahedral mesh is changed but the rest of the mesh is reused.
منابع مشابه
Octasection-based Refinement of Finite Element Approximations on Tetrahedral Meshes that Guarantees Shape Quality
Adaptive refinement of finite element approximations on tetrahedral meshes is generally considered to be a non-trivial task. (We wish to stress that this paper deals with mesh refinement as opposed to remeshing.) The splitting individual finite elements needs to be done with much care to prevent significant deterioration of the shape quality of the elements of the refined meshes. Considerable c...
متن کاملOn Nonobtuse Refinements of Tetrahedral Finite Element Meshes
It is known that piecewise linear continuous finite element (FE) approximations on nonobtuse tetrahedral FE meshes guarantee the validity of discrete analogues of various maximum principles for a wide class of elliptic problems of the second order. Such analogues are often called discrete maximum principles (or DMPs in short). In this work we present several global and local refinement techniqu...
متن کاملAdaptive Mesh Coarsening for Quadrilateral and Hexahedral Meshes
Mesh adaptation methods can improve the efficiency and accuracy of solutions to computational modeling problems. In many applications involving quadrilateral and hexahedral meshes, local modifications which maintain the original element type are desired. For triangle and tetrahedral meshes, effective refinement and coarsening methods that satisfy these criteria are available. Refinement methods...
متن کاملA tetrahedral space-filling curve for non-conforming adaptive meshes
We introduce a space-filling curve for triangular and tetrahedral red-refinement that can be computed using bitwise interleaving operations similar to the well-known Z-order or Morton curve for cubical meshes. To store the information necessary for random access, we suggest 10 bytes per triangle and 14 bytes per tetrahedron. We present algorithms that compute the parent, children, and face-neig...
متن کاملQuality local refinement of tetrahedral meshes based on 8-subtetrahedron subdivision
Let T be a tetrahedral mesh. We present a 3-D local refinement algorithm for T which is mainly based on an 8-subtetrahedron subdivision procedure, and discuss the quality of refined meshes generated by the algorithm. It is proved that any tetrahedron T ∈ T produces a finite number of classes of similar tetrahedra, independent of the number of refinement levels. Furthermore, η(Ti ) ≥ cη(T), wher...
متن کامل