Finite element mesh generation over intersecting curved surfaces by tracing of neighbours

A flexible level-set approach for tracking multiple interacting interfaces in embedded boundary methods

“…The use of component-based geometry usually requires considerable preprocessing effort to extract the wetted surface of the complete configuration [35,36] or the interface tracking and reconstruction process will suffer from increased complexity and severe performance losses. For example, standard ray tracing algorithms cannot be applied anymore and each computed intersection point between the Cartesian cells and the geometry must be tested for validity, since it could be located entirely in the solid domain X s .…”

“…Especially when multiple interfaces move independently and interact with each other, situations will occur that are difficult to deal with in explicit surface representations, such as overlaps of the respective surface meshes and topological changes [32][33][34]. Finally, although the use of component based geometry, i.e., a complex geometry which is composed of different separate components that are allowed to intersect and perform relative motion, is possible, this comes at the expense of added complexity and costs, since the reconstruction algorithm must be able to extract the relevant part of the geometry, i.e., the wetted surface [35,36].…”

Generation of triangular mesh with specified size by circle packing

“…As the neighbouring relationship of the triangular mesh has already been established in the generation process, the triangular elements intersected by the boundary segments can be determined through a neighbour tracing process [14,15] without searching.…”

“…By means of the neighbouring relationship, an efficient edge recovery scheme can be devised through a systematic use of edge swaps [15]. The entire boundary loop can be recovered by recovering line segments in a sequential manner until we come back to the starting node.…”

“…10b. In 3D space, the boundary of surface can be conveniently defined through a surface intersection process [15].…”