Meshes

A mesh is defined as a finite, face-complete element complex without any dangling elements.

$\begin{defn} % latex2html id marker 2355 [Mesh] Let ${\mathcal{M}}\subseteq {\ma... ...face cell (cf.~Definition~\ref{def:co-face_co-facet}). \end{enumerate}\end{defn}$

Requirement (iii) ensures that cell elements are the only elements, which are not faces of any other element (except the cell itself). A mesh ${\mathcal{M}}$ is called -dimensional, if ${\mathcal{M}}\in {\mathcal{P}}({\mathbb{R}}^n)$ and if ${{\operatorname{DIM}}_{\operatorname{cell}}}({\mathcal{M}}) = n$ . If ${{\operatorname{DIM}}_{\operatorname{cell}}}({\mathcal{M}}) = n-1$ , ${\mathcal{M}}$ is called an -dimensional hull mesh or -dimensional surface mesh. A mesh ${\mathcal{M}}$ with only simplex elements is called a simplex mesh, a two-dimensional (2D) mesh ${\mathcal{M}}$ with all cells being quadrilaterals is called an all-quad mesh, and a three-dimensional (3D) mesh ${\mathcal{M}}$ with all cells being hexahedrons is called an all-hex mesh.

Lemma 1 (Intersection of meshes) The intersection of two meshes ${\mathcal{M}}_1$ and ${\mathcal{M}}_2$ is finite, face-complete, and conforming. If the union of both meshes ${\mathcal{M}}_1 \cup {\mathcal{M}}_2$ is conforming, then the underlying space of the intersection is also the intersection of the underlying spaces: ${\operatorname{us}}({\mathcal{M}}_1 \cap {\mathcal{M}}_2) = {\operatorname{us}}({\mathcal{M}}_1) \cap {\operatorname{us}}({\mathcal{M}}_2)$ .

Proof.

(i)

To prove: $\vert{\mathcal{M}}_1 \cap {\mathcal{M}}_2\vert < \infty$ :
${\mathcal{M}}_1 \cap {\mathcal{M}}_2$ is finite, because ${\mathcal{M}}_1$ and ${\mathcal{M}}_2$ are meshes and therefore finite.

(ii)

To prove: ${\mathcal{M}}_1 \cap {\mathcal{M}}_2$ is face-complete:
Every element $E \in {\mathcal{M}}_1 \cap {\mathcal{M}}_2$ is also an element of ${\mathcal{M}}_1$ and ${\mathcal{M}}_2$ . Because ${\mathcal{M}}_1$ and ${\mathcal{M}}_2$ are meshes, they are both face-complete and ${\operatorname{faces}}(E)$ is a subset of ${\mathcal{M}}_1$ and ${\mathcal{M}}_2$ . Therefore, ${\operatorname{faces}}(E)$ is also a subset of ${\mathcal{M}}_1 \cap {\mathcal{M}}_2$ and ${\mathcal{M}}_1 \cap {\mathcal{M}}_2$ is face-complete.

(iii)

To prove: ${\mathcal{M}}_1 \cap {\mathcal{M}}_2$ is conforming:
Let

be two elements of ${\mathcal{M}}_1 \cap {\mathcal{M}}_2$ with non-empty intersection. Both elements are also in ${\mathcal{M}}_1$ . Because ${\mathcal{M}}_1$ is a conforming mesh, $E_1 \cap E_2$ is a face of both

and

. Therefore, ${\mathcal{M}}_1 \cap {\mathcal{M}}_2$ is conforming.

(iv)

To prove: ${\mathcal{M}}_1 \cup {\mathcal{M}}_2$ is conforming $\Rightarrow {\operatorname{us}}({\mathcal{M}}_1 \cap {\mathcal{M}}_2) = {\operatorname{us}}({\mathcal{M}}_1) \cap {\operatorname{us}}({\mathcal{M}}_2)$ :
For every point $x \in {\operatorname{us}}({\mathcal{M}}_1 \cap {\mathcal{M}}_2)$ there is an element $E \in {\mathcal{M}}_1 \cap {\mathcal{M}}_2$ , which contains

is an element of both meshes ${\mathcal{M}}_1$ and ${\mathcal{M}}_2$ and

is included in the underlying spaces of ${\mathcal{M}}_1$ and ${\mathcal{M}}_2$ . Therefore,

is also included in the intersection of the underlying spaces.

For every which is in ${\operatorname{us}}({\mathcal{M}}_1)$ and in ${\operatorname{us}}({\mathcal{M}}_2)$ , there are elements $E_1 \in {\mathcal{M}}_1$ and $E_1 \in {\mathcal{M}}_2$ , which both contain . Because ${\mathcal{M}}_1 \cup {\mathcal{M}}_2$ is conforming, the intersection $E_1 \cap E_2$ (which also contains ) is a face of both and . Therefore, $E_1 \cap E_2$ is included in both meshes ${\mathcal{M}}_1$ and ${\mathcal{M}}_2$ and also in their intersection ${\mathcal{M}}_1 \cap {\mathcal{M}}_2$ . Ultimately, the set $E_1 \cap E_2$ , which contains , is a subset of the underlying space of the mesh intersection.

Therefore, ${\operatorname{us}}({\mathcal{M}}_1 \cap {\mathcal{M}}_2)$ is a subset of ${\operatorname{us}}({\mathcal{M}}_1) \cap {\operatorname{us}}({\mathcal{M}}_2)$ and ${\operatorname{us}}({\mathcal{M}}_1) \cap {\operatorname{us}}({\mathcal{M}}_2)$ is a subset of ${\operatorname{us}}({\mathcal{M}}_1 \cap {\mathcal{M}}_2)$ , which make these two sets equal.

$\qedsymbol$

**Figure 2.7:** Mesh intersection
$\begin{subfigure}[b]{0.15\textwidth} \centering \includegraphics[width=0.99\textwidth]{figures/intersection_of_meshes_dangling} \end{subfigure}$ The intersection of these two meshes (colored in green), being two edges and an isolated vertex, is not a mesh, because the isolated vertex is a dangling element.

In general, however, the intersection of two meshes is not a mesh because it may contain dangling elements as shown in Figure 2.7. The second part of this Lemma states, that if the union of two meshes is conforming (i.e. the union is a mesh), then their intersection covers the same space as the intersection of the geometries of the meshes. This is not true for the intersection of two meshes, where their union is not conforming. For example, let ${\mathcal{M}}_1$ be a mesh which contains a line and its boundary vertices and ${\mathcal{M}}_2$ be a mesh which solely contains the vertex located at the center of the line. Then, ${\mathcal{M}}_1 \cap {\mathcal{M}}_2 = \emptyset$ but the intersection of ${\operatorname{us}}({\mathcal{M}}_1)$ and ${\operatorname{us}}({\mathcal{M}}_2)$ is the middle point of the line. The intersection of meshes will play an important role for the boundary patch partition in Section 4.3.

Similar to manifold partitions (cf. Appendix A), meshes can also be partitioned using the following approach:

$\begin{defn} % latex2html id marker 2382 [Mesh partition] Let ${\mathcal{M}}$\ b... ... less than the maximum cell dimension of $A$\ and $B$. \end{enumerate}\end{defn}$

A mesh partition does not necessarily consist of meshes with the same dimension. For example, a mesh containing one triangle (and all its faces) can have a mesh partition with the triangle (and all its faces) and all triangle edges (and all of their vertices). However, any cell of ${\mathcal{M}}$ is in exactly one element of a mesh partition of ${\mathcal{M}}$ . Therefore, the underlying space of ${\mathcal{M}}$ is equal to the union of the underlying spaces of all elements of the partition.

Similar to geometries, meshes are also defined with multi-region support.

$\begin{defn}[Multi-region mesh] Let ${\mathcal{M}}$\ be a mesh in ${\mathbb{R}}^... ...\xi})}$\ is denoted as $\operatorname{rc}({({\mathcal{M}}, {\xi})})$. \end{defn}$

**Figure 2.8:** 2D multi-region mesh
$\begin{subfigure}[b]{0.95\textwidth} \centering \includegraphics[width=0.3\textwidth]{figures/multi_region_meshes} \end{subfigure}$

For a multi-region mesh ${({\mathcal{M}}, {\xi})}$ , $E \in {({\mathcal{M}}, {\xi})}$ is also written for $E \in {\mathcal{M}}$ . An example of a 2D multi-region mesh is shown in Figure 2.8.

Lemma 2 (Region is a mesh) For a multi-region mesh ${({\mathcal{M}}, {\xi})}$ , every region ${\operatorname{region}}({({\mathcal{M}}, {\xi})}, i)$ is a mesh.

Proof.

(i): $\vert{\operatorname{region}}({({\mathcal{M}}, {\xi})}, i)\vert$ is finite:
${\operatorname{region}}({({\mathcal{M}}, {\xi})}, i)$ is a subset of the finite mesh ${({\mathcal{M}}, {\xi})}$ and therefore also finite.
(ii): ${\operatorname{region}}({({\mathcal{M}}, {\xi})}, i)$ is face-complete:
Every element $E \in {\operatorname{region}}({({\mathcal{M}}, {\xi})}, i)$ is, by definition, also in ${\mathcal{M}}$ . The faces of are included in ${\mathcal{M}}$ , because ${\mathcal{M}}$ is face-complete. From the definition of ${\xi}$ follows, that for every faces of , ${\xi}(F)$ contains . Therefore, every face of is also in ${\operatorname{region}}({({\mathcal{M}}, {\xi})}, i)$ and ${\operatorname{region}}({({\mathcal{M}}, {\xi})}, i)$ is face-complete.
(iii): ${\operatorname{region}}({({\mathcal{M}}, {\xi})}, i)$ is conforming:
Let be two elements of ${\operatorname{region}}({({\mathcal{M}}, {\xi})}, i)$ with non-empty intersection. Then, and are also in ${\mathcal{M}}$ . Because of the conformity of ${\mathcal{M}}$ , $E_1 \cap E_2$ is a face of both and and because ${\operatorname{region}}({({\mathcal{M}}, {\xi})}, i)$ is face-complete, $E_1 \cap E_2$ is an element of ${\operatorname{region}}({({\mathcal{M}}, {\xi})}, i)$ . Therefore, ${\operatorname{region}}({({\mathcal{M}}, {\xi})}, i)$ is conforming.
(iv): ${\operatorname{region}}({({\mathcal{M}}, {\xi})}, i)$ has no dangling elements (except cells):
From the definition of ${\xi}$ follows, that for every non-cell element of ${\operatorname{region}}({({\mathcal{M}}, {\xi})}, i)$ there is a co-face cell of in ${\operatorname{region}}({({\mathcal{M}}, {\xi})}, i)$ . Therefore, ${\operatorname{region}}({({\mathcal{M}}, {\xi})}, i)$ has no dangling elements.

$\qedsymbol$

Every mesh ${\mathcal{M}}$ is also a multi-region mesh ${({\mathcal{M}}, {\xi})}$ , where the mesh region indicator function ${\xi}$ maps every element to $\{1\}$ . On the other hand, a multi-region mesh ${({\mathcal{M}}, {\xi})}$ , with a mesh region indicator function ${\xi}$ mapping all elements to $\{1\}$ , can be identified by the mesh ${\mathcal{M}}$ . Therefore, all statements for multi-region meshes also hold for meshes.

$\begin{defn} % latex2html id marker 2409 [Boundary of a mesh, region interface] ... ...k {\operatorname{region}}({({\mathcal{M}}, {\xi})},i_j) \end{equation}\end{defn}$

Similar to geometry interfaces, the interface of mesh regions is equal to:

The boundary ${\operatorname{bnd}}({\mathcal{M}})$ of a mesh ${\mathcal{M}}$ is again a mesh with ${{\operatorname{DIM}}_{\operatorname{cell}}}({\operatorname{bnd}}^\star ({\mathcal{M}})) = {{\operatorname{DIM}}_{\operatorname{cell}}}({\mathcal{M}})-1$ . Because a mesh region is also a mesh, the definition of the boundary of a mesh region is the same as the boundary of a mesh.

A triangulation of a finite point set $S \subseteq {\mathbb{R}}^n$ is a special type of mesh which is important for constructing high quality meshes. Additionally, proofs for quality-guarantees of mesh generation algorithms usually require a triangulation [127].

$\begin{defn} % latex2html id marker 2420 [Triangulation] Given a point set $S = ... ...torname{conv}}(S)$\ and ${\operatorname{elem}}_0({\mathcal{M}}) = S$. \end{defn}$

2.2 Meshes