SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion

DOI10.1145/1055531.1055537zbMath1073.65017OpenAlexW2077542803WikidataQ113310727 ScholiaQ113310727MaRDI QIDQ5461223

John Mellor-Crummey, Guohua Jin

Publication date: 22 July 2005

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1055531.1055537

zbMATH Keywords

performancenumerical examplesHilbert curvesPeano curvesSierpiński curveMorton curvesmulti-dimensional space-filling curvestable-based indexing algorithmuniversal turtle algorithm

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (6)

Compact Hilbert indices: space-filling curves for domains with unequal side lengths ⋮ Evaluation of an Efficient Stack-RLE Clustering Concept for Dynamically Adaptive Grids ⋮ Van der Corput and Golden Ratio Sequences Along the Hilbert Space-Filling Curve ⋮ Two-constraint domain decomposition with space filling curves ⋮ SFCGen ⋮ An arithmetic-analytical expression of the Hilbert-type space-filling curves and its applications

Uses Software

• Algorithm 781

This page was built for publication: SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion