A Mathematical and Geometrical Background
Mathematical and geometrical definitions and lemmas as well as proof of lemmas important for this work are presented in this appendix. Unless explicitly stated otherwise, the topological vector space
, where is the standard topology induced by the Euclidean norm9.1, is used throughout this thesis.
More specifically, this work focuses on the topological vector spaces
and
.
therefore maps from the domain
to the image
.
The composition of two functions and is invalid, if
.
Every connected set is trivially piecewise connected. A closed bounded set in
is compact. Figure A.1 visualizes the connected property.
A hyperplane is defined a linear subset of
which has a dimension of :
An important type of subsets of
are manifolds.
In the literature, manifolds are usually not required to be compact and do not include their boundary. The definition in this work has been chosen to ease notation.
The standard definition of the interior and the boundary is non-intuitive for -manifolds in
with . For example, the interior of a triangle in
is empty and the boundary (defined as the closure without the interior) is
.
Therefore, a more intuitive definition of the interior and the boundary of manifolds is used in this work:
The boundary of a -manifold is a -manifold.
For example, the closed unit -ball
is an -manifold. The interior of
,
, is the open unit -ball
. The boundary of
is the set
which is an -manifold.
Some properties of manifolds are presented in the next lemma.
Proof.
- (i)
- Follows trivially from the definition of a manifold and the relative interior.
- (ii)
- Assume,
, then there is an
which is also in . has a neighbor based on the topology
which is homeomorph to
.
has also a neighborhood based on the topology
which is homeomorph to
.
Because
, is a subset of . can be scaled down to be a subset of . However, there is no neighborhood which is homeomorph to
which is a subset of (which is homeomorph to
) with
. Therefore,
has to be less or equal to
.
- (iii)
- For
,
and
is empty. Otherwise, for
(
can not be larger than due to (ii)),
is empty.
Let
. For every
there is a neighborhood of based on the topology
which is homeomorph to
. Because
, is also in . Every neighborhood of based on the topology
is either homeomorph to
or
. Because is also a subset of , every neighborhood of based on the topology
has to be homeomorph to
. Therefore, is in
.
- (iv)
- If
or
,
and
are empty.
Let
. For
, is in
and has a neighborhood based on the topology
which is homeomorph to
. Also, is in
and has a neighborhood based on the topology
which is homeomorph to
.
is a neighborhood based on the topology
of which is homeomorph to
. Therefore,
is a subset
.
On the other hand, every
has a neighborhood
based on the topology
which is homeomorph to
. Every neighborhood of based on the topology
is either homeomorph to
or
. The neighborhood
can be scaled down to be a subset of . Therefore, has to be homeomorph to
leading to also being in
. A similar argument can be applied to the set . Therefore, is in
and in
and consequently
is a subset of
.
The boundary of manifolds used in this work can be represented as union of other manifolds with lower dimensions. For example, the boundary of a triangle can be represented as the union of its three lines.
Boundary elements which are maximal, i.e. there are no larger elements which are included in the boundary, are called facets. The facets and recursively all facets of facets of a manifold are called faces.
The
-dimensional faces of an element is itself (
) and the
-dimensional faces are the facets (
).
Figure A.2:
Element faces are not minimal
The element space
represents a triangle with two polylines boundary elements and three vertices. The boundary of the triangle can be represented as the union of the two polylines. However, the line connecting the lower two vertices occurs twice in that union. |
Intuitively, the facets of an element should be a minimal cover of its boundary
. Figure A.2 visualizes an element space where the boundary representation of a cell is not minimal.
Therefore, the term face-complete is introduced:
Similar to the faces and facets, the co-faces and co-facets of an element are defined as the elements of which is a face or a facet, respectively.
Elements which share a common face are called neighbors.
A very important property, especially for discretization-based simulation methods, is conformity. The intersection of two different elements of a conforming element space is a face of both elements. This property enables straight-forward interfaces between two neighboring cells which simplifies interaction between them.
Conforming element spaces play a central role in this work.
Connected compact -manifolds are the basic building blocks of meshes, called mesh elements.
Linear mesh elements are the most basic elements used in this work. They are defined using affine and convex hulls.
Figure A.3:
Affine and convex hull
The left row visualizes different sets of points. The affine hull and the convex hull of the corresponding point set is given in the middle row and the right row, respectively. |
An affine combination with all weights
is called a convex combination.
The convex hull of a set is equal to all convex combinations of points from that set.
Figure A.3 shows examples of the affine and convex hull of different sets of points.
The most basic linear mesh elements are called simplices.
A 0-simplex is called a vertex, a -simplex is called a line or edge, a -simplex is called a triangle, and a -simplex is called a tetrahedron. Simplices are visualized in Figure A.4.
is empty for because there are there are no affinely independent sets of points in
.
Figure A.5:
Faces
From left to right: a tetrahedron, its 2D faces (four triangles), its 1D faces (six edges), and its 0D faces (four vertices). |
For every vertex
, its facet set and therefore its face set is empty.
For every other -simplex being the convex hull of
, all facets of are simplices using a -subset:
|
(9.1) |
Figure A.5 visualizes a tetrahedron with all of its faces.
Non-trivial linear elements are called polyhedrons:
Convex -polyhedra and linear -cells are compact -manifolds.
A linear 0-cell is a vertex, a linear -cell is a line, a linear -cell is a called a polygon, and a linear -cell is called a (not necessarily convex) polyhedron.
Although this work mainly focuses on simplices, some algorithms and proofs also hold for a larger class of elements. A hypercube-motivated approach is used to define more elements, especially quadrilaterals and hexahedrons.
To exclude exotic subsets of
, only parameterizations which lead to manifolds are allowed (restriction (i)). Restriction (ii) prevents the parameterized element from being degenerated and self-intersecting. The third restriction (iii) ensures, that the parameterized element is bounded and closed and therefore compact. Additionally, (iii) gives a parameterization for the boundary of the parameterized element.
The definition of the -interpolation combination is motivated by the recursive parameterization of a hypercube. Note, that a -interpolation combination is not a linear function in general. Therefore, when using a parameterized element based on a -interpolation combination, the element does not need to be linear. However, for fixed
the -interpolation combination is linear in .
When using pairwise different points, the parameterized element using a -interpolation combination results in a quadrilateral and using a -interpolation combination results in a hexahedron. The -interpolation combination is injective for these element types.
Quadrilaterals in
are convex and their boundary is piecewise linear. The facets of a quadrilateral are four lines:
|
(9.2) |
The facets of a hexahedron are six quadrilaterals:
|
(9.3) |
While mixed element spaces with triangle and quadrilateral cell elements can be conforming, more element types are required for 3D element spaces because tetrahedrons and hexahedrons do not share any facet type.
Mixed element spaces are not a focus of this work, however for the sake of completeness two additional element types are defined using a non-injective -interpolation combination.
A -interpolation combination where the last four points are all the same results in a pyramid. A -interpolation combination, where the 3rd and 4th as well as the 7th and the 8th point are equal results in a triangular prism, also called wedge.
The facets of a pyramid are four triangles and one quadrilateral:
|
(9.4) |
The facets of a wedge are two triangles and three quadrilaterals:
|
(9.5) |
Examples of quadrilaterals, hexahedrons, pyramids, and wedges are shown in Figure A.6.
Figure A.6:
Non-simplex elements
From left to right: a quadrilateral, a hexahedron, a pyramid, and a wedge. |
Simplices can also be represented using parameterized elements:
is a line,
is a triangle, and
is a tetrahedron.
All elements presented here are connected compact manifolds. A vertex is a 0-manifold, a line is a -manifold, triangles and quadrilaterals are -manifolds, and tetrahedrons, hexahedrons, pyramids, and wedges are -manifolds.
The presented mesh elements are combined in the mesh element space which is defined as follows:
The geometry space
is equal to the set of all polyhedra which are manifolds:
.
The element spaces
,
,
,
,
, and
are face-complete for
.
However, it is generally not possible to have a non-trivial partition of a closed set consisting of closed sets. Therefore, a slight abstraction of a partition is defined.
A manifold partition of a -manifold allows for an arbitrary number of - not necessarily disjunct - manifolds which have a dimension less than . For example, the closed unit -ball can have a valid manifold partition which consists of the closed unit -ball itself and its boundary.
Using this definition, it is possible to create a manifold partition of a -manifold using manifolds.
Figure A.7:
The intersection of manifolds is not a manifold
The intersection of the two manifolds colored in blue and red is highlighted in green. This intersection is not a manifold. |
The choice of
and
only containing linear elements is motivated by the requirements for the boundary patch partition (cf. Section 4.3), which requires the intersection of sets.
This intersection should be representable by mesh elements or geometries.
However, the intersection of two manifolds is generally not a manifold. This is even true for simple manifolds as visualized in Figure A.7. Instead of representing the intersection of sets with a single mesh element or geometry, the approach used in this work is to represent the intersection as a union of mesh elements or geometries.
In general, the intersection partition is not unique. Due to the definition of conformity, every element complex is IPC.
Lemma 2 (
is not IPC)
The set of all manifolds
is not IPC.
Proof.
Let
be two non-empty compact sets with
and
.
Then,
is continuous and
if and only if
. Let
be the graph of
and
.
and
are
-manifolds and their intersection is
.
Choosing
and
yields and being -manifolds. However, there is no finite manifold partition of
.
The geometry space
, however, is IPC.
Lemma 3 (
is IPC)
The geometry space
is IPC.
Proof.
For
,
and
can be represented as a finite union of simplices:
,
. The intersection
can be reformulated in the following way:
|
(9.6) |
The intersection of the simplices
and
can be represented as a finite union of simplices. Therefore,
can be represented as a finite union of simplices and
is IPC.
The partition of two sets used for the IPC property is called the intersection partition.
Every element of an intersection partition of two sets and is naturally a subset of the intersection of . Additionally, according to Lemma A.1, the dimension of every element of the intersection partition of and is at most
.
Two manifold partitions of the same set can be combined to create a finer manifold partition.
The intuitive approach for a refinement of two manifold partitions would look like this:
|
(9.7) |
However, as mentioned above, the intersection of two manifolds is not a manifold, but for
the intersection partition can be used. The refinement of two manifold partitions is defined as follows:
Proof.
- (i)
- To prove:
:
The finite combination of finite sets is again finite.
- (ii)
- To prove:
:
is not an element of
due to the definition of intersection partition.
- (iii)
- To prove:
is a covering of :
At first,
is shown, followed by
.
For all there are partition elements and which both contain . Therefore, is in the intersection and there is a set in the intersection partition of and which also contains . is an element of
. Consequently,
.
On the other hand, for all
, there is a set
which contains . In turn, there are partition elements and for which is in their intersection partition. Because is in , is also and and consequently also in .
- (iv)
- To prove:
for all sets of
:
Let be the dimension of and and two different elements of
. For
, there are partition elements and for which is in the intersection partition of and . Similarly, for
, there are partition elements and for which is in the intersection partition of and .
If and , then
is empty due to the definition of the intersection partition.
Otherwise, from Lemma A.1 and due to the assumption that
and
are less or equal to follows, that
However, and are manifold partitions and
.
florian
2016-11-21