16 citations · 25 across the 5 of their papers we have counts for
5 papers
An Optimized, Parallel Computation of the Ghost Layer for Adaptive Hybrid Forest Meshes
Johannes Holke, David Knapp, Carsten Burstedde
We discuss parallel algorithms to gather topological information about off-process mesh neighbor elements. This information is commonly called the ghost layer, whose creation is a…
Scalable Algorithms for Parallel Tree-based Adaptive Mesh Refinement with General Element Types
Johannes Holke
In this thesis, we develop, discuss and implement algorithms for scalable parallel tree-based adaptive mesh refinement (AMR) using space-filling curves (SFCs). We create an AMR sof…
Coarse mesh partitioning for tree based AMR
Carsten Burstedde, Johannes Holke
In tree based adaptive mesh refinement, elements are partitioned between processes using a space filling curve. The curve establishes an ordering between all elements that derive f…
A tetrahedral space-filling curve for non-conforming adaptive meshes
Carsten Burstedde, Johannes Holke
We introduce a space-filling curve for triangular and tetrahedral red-refinement that can be computed using bitwise interleaving operations similar to the well-known Z-order or Mor…
Bounds on the number of discontinuities of Morton-type space-filling curves
Carsten Burstedde, Johannes Holke, Tobin Isaac
The Morton- or z-curve is one example for a space filling curve: Given a level of refinement L, it maps the interval [0, 2**dL) one-to-one to a set of d-dimensional cubes of edge l…