Recurrence for Pandimensional Space-Filling Functions
Aubrey Jaffer

TL;DR
This paper introduces recurrences for constructing pandimensional space-filling functions and curves, generalizing Peano and Hilbert curves to any dimension, with applications in optimization, indexing, and dimension reduction.
Contribution
It presents a unified recurrence-based method to generate space-filling functions and curves of any dimension, including their inverses, extending classical curves to higher dimensions.
Findings
Recurrences produce space-filling functions for any dimension d ≥ 2.
Hilbert curves outperform Peano curves in dimension reduction.
The methods enable extension beyond unit hypercubes and facilitate comparison of different curves.
Abstract
A space-filling function is a bijection from the unit line segment to the unit square, cube, or hypercube. The function from the unit line segment is continuous. The inverse function, while well-defined, is not continuous. Space-filling curves, the finite approximations to space-filling functions, have found application in global optimization, database indexing, and dimension reduction among others. For these applications the desired transforms are mapping a scalar to multidimensional coordinates and mapping multidimensional coordinates to a scalar. Presented are recurrences which produce space-filling functions and curves of any rank based on serpentine Hamiltonian paths on where . The recurrences for inverse space-filling functions are also presented. Both Peano and Hilbert curves and functions and their generalizations to higher dimensions are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Advanced Numerical Analysis Techniques · Advanced Optimization Algorithms Research
