Fast algorithm for extracting domains and regions from three-dimensional triangular surface meshes

Correct mesh handling and in particular domain extraction is an important step of many simulation workflows. In the boundary element method, for example, only the surfaces of arbitrarily shaped domains have to be meshed. Here, an algorithm is presented that extracts all distinct spatial regions and domains from a given non-manifold three-dimensional surface triangulation without the need for a volume mesh. Only the coordinates of the mesh vertices and the connectivity matrix of the triangulation need to be given. The process is robust, easy to implement, and efficient. No geometric features such as edges or faces need to be detected or specified for the method to work. Thus, the method is suitable for mesh formats that do not contain information about the geometry partitioning. The algorithm is presented in detail, test cases are discussed, and an exemplary implementation is given. [Display omitted] •Robust and fast extraction of all spatial domains present in a non-manifold three-dimensional surface triangulation.•No volume meshes or detection of geometric features are required.•Automatically provides oriented connectivity matrices with normal vectors pointing in the same direction.•Provides correct results even when domains are connected by a single vertex or edge.