Surface and hypersurface meshing techniques for space-time finite element methods

01/28/2023
by   Jude T. Anderson, et al.
0

A general method is introduced for constructing two-dimensional (2D) surface meshes embedded in three-dimensional (3D) space time, and 3D hypersurface meshes embedded in four-dimensional (4D) space time. In particular, we begin by dividing the space-time domain into time slabs. Each time slab is equipped with an initial plane (hyperplane), in conjunction with an unstructured simplicial surface (hypersurface) mesh that covers the initial plane. We then obtain the vertices of the terminating plane (hyperplane) of the time slab from the vertices of the initial plane using a space-time trajectory-tracking approach. Next, these vertices are used to create an unstructured simplicial mesh on the terminating plane (hyperplane). Thereafter, the initial and terminating boundary vertices are stitched together to form simplicial meshes on the intermediate surfaces or sides of the time slab. After describing this new mesh-generation method in rigorous detail, we provide the results of multiple numerical experiments which demonstrate its validity and flexibility.

READ FULL TEXT

page 25

page 27

research
08/13/2021

Construction of 4D Simplex Space-Time Meshes for Local Bisection Schemes

Adaptive mesh refinement is a key component of efficient unstructured sp...
research
10/17/2022

Simplex space-time meshes in engineering applications with moving domains

This paper highlights how unstructured space-time meshes can be used in ...
research
12/28/2020

Four-Dimensional Elastically Deformed Simplex Space-Time Meshes for Domains with Time Variant Topology

Thinking of the flow through biological or technical valves, there is a ...
research
02/09/2021

Simulating dense granular flow using the μ(I)-rheology within a space-time framework

A space-time framework is applied to simulate dense granular flow. Two d...
research
06/04/2018

A 44-element mesh of Schneiders' pyramid: bounding the difficulty of hex-meshing problems

This paper shows that constraint programming techniques can successfully...
research
12/01/2022

Tutte Embeddings of Tetrahedral Meshes

Tutte's embedding theorem states that every 3-connected graph without a ...
research
06/04/2018

A 66-element mesh of Schneiders' pyramid: bounding the difficulty of hex-meshing problems

This paper shows that constraint programming techniques can successfully...

Please sign up or login with your details

Forgot password? Click here to reset