A tetrahedral space-filling curve for nonconforming adaptive meshes
From MaRDI portal
Publication:2821775
Abstract: 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 Morton curve for cubical meshes. To store sufficient information for random access, we define a low-memory encoding using 10 bytes per triangle and 14 bytes per tetrahedron. We present algorithms that compute the parent, children, and face-neighbors of a mesh element in constant time, as well as the next and previous element in the space-filling curve and whether a given element is on the boundary of the root simplex or not. Our presentation concludes with a scalability demonstration that creates and adapts selected meshes on a large distributed-memory system.
Recommendations
- Space-filling curves for 2-simplicial meshes created with bisections and reflections.
- Efficient Storage and Processing of Adaptive Triangular Grids Using Sierpinski Curves
- Space-Filling Curves
- SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion
- Locally Adapted Tetrahedral Meshes Using Bisection
Cites work
- scientific article; zbMATH DE number 849031 (Why is no real title available?)
- A Convergent Adaptive Algorithm for Poisson’s Equation
- A recursive approach to local mesh refinement in two and three dimensions
- Algorithms and data structures for massively parallel generic adaptive finite element codes
- An adaptive mesh-refining algorithm allowing for an H^1 stable L^2 projection onto Courant finite element spaces
- Automated solution of differential equations by the finite element method. The FEniCS book
- Bottom-Up Construction and 2:1 Balance Refinement of Linear Octrees in Parallel
- Computation of electromagnetic scattering with a non‐conforming discontinuous spectral element method
- Delaunay refinement algorithms for triangular mesh generation
- Delaunay triangulation and 3D adaptive mesh generation
- Error Estimates for Adaptive Finite Element Computations
- Finding good approximate vertex and edge partitions is NP-hard
- Load balancing for adaptively refined grids
- Local mesh refinement in 2 and 3 dimensions
- Locality and bounding-box quality of two-dimensional space-filling curves
- On a Data Structure for Adaptive Finite Element Mesh Refinements
- PLUM: Parallel load balancing for adaptive unstructured meshes
- Parallel tetrahedral mesh adaptation with dynamic load balancing
- Peano -- a traversal and storage scheme for octree-like adaptive Cartesian multiscale grids
- Recursive algorithms for distributed forests of octrees
- Refinement and connectivity algorithms for adaptive discontinuous Galerkin methods
- Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes
- Space-Filling Curves
- Space-filling curves
- Spectral element methods for transitional flows in complex geometries
- Triangulations and applications
- deal.II—A general-purpose object-oriented finite element library
- p4est: scalable algorithms for parallel adaptive mesh refinement on forests of octrees
Cited in
(9)- On the number of face-connected components of Morton-type space-filling curves
- Space-time unfitted finite elements on moving explicit geometry representations
- Hamiltonian triangular refinements and space-filling curves
- Space-filling curves for 2-simplicial meshes created with bisections and reflections.
- A Generic Finite Element Framework on Parallel Tree-Based Adaptive Meshes
- Coarse mesh partitioning for tree-based AMR
- The aggregated unfitted finite element method on parallel tree-based adaptive meshes
- An optimized, parallel computation of the ghost layer for adaptive hybrid forest meshes
- Efficient Storage and Processing of Adaptive Triangular Grids Using Sierpinski Curves
Describes a project that uses
Uses Software
This page was built for publication: A tetrahedral space-filling curve for nonconforming adaptive meshes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2821775)