SUMMARYA unified strategy for the higher-order accurate integration of implicitly defined geometries is proposed. The geometry is represented by a higher-order level-set function. The task is to integrate either on the zero-level set or in the sub-domains defined by the sign of the level-set function. In three dimensions, this is either an integration on a surface or inside a volume. A starting point is the identification and meshing of the zero-level set by means of higher-order interface elements. For the volume integration, special sub-elements are proposed where the element faces coincide with the identified interface elements on the zero-level set. Standard Gauss points are mapped onto the interface elements or into the volumetric sub-elements. The resulting integration points may, for example, be used in fictitious domain methods and extended finite element methods. For the case of hexahedral meshes, parts of the approach may also be seen as a higher-order marching cubes algorithm.
An accurate implicit description of geometries is enabled by the level-set method.Level-set data is given at the nodes of a higher-order background mesh and the interpolated zero-level sets imply boundaries of the domain or interfaces within. The higher-order accurate integration of elements cut by the zero-level sets is described.The proposed strategy relies on an automatic meshing of the cut elements. Firstly, the zero-level sets are identified and meshed by higher-order interface elements. Secondly, the cut elements are decomposed into conforming sub-elements on the two sides of the zero-level sets. Any quadrature rule may then be employed within the sub-elements.The approach is described in two and three dimensions without any requirements on the background meshes. Special attention is given to the consideration of corners and edges of the implicit geometries.
SUMMARYA new higher-order accurate method is proposed that combines the advantages of the classical p-version of the FEM on body-fitted meshes with embedded domain methods. A background mesh composed by higherorder Lagrange elements is used. Boundaries and interfaces are described implicitly by the level set method and are within elements. In the elements cut by the boundaries or interfaces, an automatic decomposition into higher-order accurate sub-elements is realized. Therefore, the zero level sets are detected and meshed in a first step, which is called reconstruction. Then, based on the topological situation in the cut element, higher-order sub-elements are mapped to the two sides of the boundary or interface. The quality of the reconstruction and the mapping largely determines the properties of the resulting, automatically generated conforming mesh. It is found that optimal convergence rates are possible although the resulting sub-elements are not always well-shaped.
Numerical simulations of structures using higher-order finite elements is still a challenging task, in particular for domains with curved boundaries. A new higher-order accurate approach is proposed, combining the advantages of the classical p-FEM with embedded domain methods. Boundaries and/or interfaces are described implicitly using the level set method. In the elements cut by the zero level set, an automatic decomposition into interface aligned, i.e. conforming sub-elements is realized. Transfinite mappings are utilized to construct higher-order sub-elements by mappings of reference elements to the two sides of the boundary or interface. It is shown that although the resulting sub-elements are not always well-shaped, optimal convergence rates are possible.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.