Add to ORKGThe following slides are our contribution to the Meshing Contest of the International Meshing Roundtable 2022. We show a hybrid adaptively refined mesh of the Seattle Spaceneedle
We revisit the generation of balanced octrees for adaptive mesh refinement (AMR) of Cartesian domain...
A new massive-splitting parallelization concept using Sierpinski space-filling curves with dynamic a...
Managing adaptive meshes in parallel is a major challenge, especially when the meshes are refined an...
In this thesis we present a space-filling curve for pyramid elements. We use the new approach for th...
We present a space-filling curve for pyramids to enable fully hybrid adaptive mesh refinement. The S...
Meshes are a core part of almost any numerical simulation code. A good choice of mesh is crucial t...
In (dynamic) adaptive mesh refinement (AMR), a given input mesh is refined and coarsened during the ...
In tree-based adaptive mesh refinement (AMR) we store refinement trees in the cells of an unstructur...
We present a newly developed, self-contained theory for discrete space-filling curves (SFCs). Mesh p...
Increasing the resolution of the computational mesh is one of the most effective tools to boost the ...
summary:Numerical experiments in J. Maubach: Local bisection refinement and optimal order algebraic...
Larger supercomputers allow the resolution of more complex problems that require denser and thus als...
Larger supercomputers allow the simulation of more complex phenomena with increased accuracy. Eventu...
: In (dynamic) adaptive mesh refinement (AMR), a given input mesh is refined and coarsened during th...
We revisit the generation of balanced octrees for adaptive mesh refinement (AMR) of Cartesian domain...
A new massive-splitting parallelization concept using Sierpinski space-filling curves with dynamic a...
Managing adaptive meshes in parallel is a major challenge, especially when the meshes are refined an...
In this thesis we present a space-filling curve for pyramid elements. We use the new approach for th...
We present a space-filling curve for pyramids to enable fully hybrid adaptive mesh refinement. The S...
Meshes are a core part of almost any numerical simulation code. A good choice of mesh is crucial t...
In (dynamic) adaptive mesh refinement (AMR), a given input mesh is refined and coarsened during the ...
In tree-based adaptive mesh refinement (AMR) we store refinement trees in the cells of an unstructur...
We present a newly developed, self-contained theory for discrete space-filling curves (SFCs). Mesh p...
Increasing the resolution of the computational mesh is one of the most effective tools to boost the ...
summary:Numerical experiments in J. Maubach: Local bisection refinement and optimal order algebraic...
Larger supercomputers allow the resolution of more complex problems that require denser and thus als...
Larger supercomputers allow the simulation of more complex phenomena with increased accuracy. Eventu...
: In (dynamic) adaptive mesh refinement (AMR), a given input mesh is refined and coarsened during th...
We revisit the generation of balanced octrees for adaptive mesh refinement (AMR) of Cartesian domain...
A new massive-splitting parallelization concept using Sierpinski space-filling curves with dynamic a...
Managing adaptive meshes in parallel is a major challenge, especially when the meshes are refined an...