On the number of face-connected components of Morton-type space-filling curves
DOI10.1007/s10208-018-9400-5zbMath1422.65243arXiv1505.05055OpenAlexW2895678636WikidataQ129130117 ScholiaQ129130117MaRDI QIDQ2317382
Johannes Holke, Carsten Burstedde, Tobin Isaac
Publication date: 9 August 2019
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.05055
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50)
Related Items (1)
Uses Software
Cites Work
- Parallel multigrid in an adaptive PDE solver based on hashing and space-filling curves
- Locality and bounding-box quality of two-dimensional space-filling curves
- Space-filling curves
- Quad trees: A data structure for retrieval by composite keys
- Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
- A Tetrahedral Space-Filling Curve for Nonconforming Adaptive Meshes
- Space-Filling Curves
- 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
- deal.II—A general-purpose object-oriented finite element library
This page was built for publication: On the number of face-connected components of Morton-type space-filling curves