A Tetrahedral Space-Filling Curve for Nonconforming Adaptive Meshes
DOI10.1137/15M1040049zbMath1348.65173arXiv1509.04627OpenAlexW2272758157MaRDI QIDQ2821775
Johannes Holke, Carsten Burstedde
Publication date: 23 September 2016
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.04627
algorithmhigh performance computingspace-filling curveparallel adaptive mesh refinementMorton codeforest of octreesnonconforming simplicial mesh
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Parallel numerical computation (65Y05) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Locality and bounding-box quality of two-dimensional space-filling curves
- Finding good approximate vertex and edge partitions is NP-hard
- PLUM: Parallel load balancing for adaptive unstructured meshes
- Space-filling curves
- Delaunay triangulation and 3D adaptive mesh generation
- Parallel tetrahedral mesh adaptation with dynamic load balancing
- Delaunay refinement algorithms for triangular mesh generation
- Spectral element methods for transitional flows in complex geometries
- A recursive approach to local mesh refinement in two and three dimensions
- Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes
- Triangulations and applications
- Space-Filling Curves
- Recursive Algorithms for Distributed Forests of Octrees
- Algorithms and data structures for massively parallel generic adaptive finite element codes
- Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
- p4est: Scalable Algorithms for Parallel Adaptive Mesh Refinement on Forests of Octrees
- Peano—A Traversal and Storage Scheme for Octree-Like Adaptive Cartesian Multiscale Grids
- Bottom-Up Construction and 2:1 Balance Refinement of Linear Octrees in Parallel
- deal.II—A general-purpose object-oriented finite element library
- On a Data Structure for Adaptive Finite Element Mesh Refinements
- Local mesh refinement in 2 and 3 dimensions
- Error Estimates for Adaptive Finite Element Computations
- Computation of electromagnetic scattering with a non‐conforming discontinuous spectral element method
- A Convergent Adaptive Algorithm for Poisson’s Equation
This page was built for publication: A Tetrahedral Space-Filling Curve for Nonconforming Adaptive Meshes