Space filling curves and their use in the design of geometric data structures
From MaRDI portal
(Redirected from Publication:5096322)
Recommendations
- Space-filling curves and their use in the design of geometric data structures
- Space-Filling Curves
- SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion
- Optimality of clustering properties of space-filling curves
- Locality and bounding-box quality of two-dimensional space-filling curves
Cites work
Cited in
(9)- Space-filling curves and their use in the design of geometric data structures
- Space-Filling Curves
- Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves
- A fortran procedure for drawing some space-filling curves
- Generation of Spatial Orders and Space-Filling Curves
- Towards optimal locality in mesh-indexings
- SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion
- A level-wise load balance method underlying block-structured adaptive mesh refinement for LBM
- A mesh partitioning algorithm for preserving spatial locality in arbitrary geometries
This page was built for publication: Space filling curves and their use in the design of geometric data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096322)