Generalised 3D Morton and Hilbert Orderings
David Walker
TL;DR
This paper introduces algorithms for generating generalized 3D Morton and Hilbert space-filling curves, which are useful for organizing three-dimensional data efficiently.
Contribution
It presents new algorithms for 3D Morton and Hilbert orderings that extend existing methods to more general cases.
Findings
Efficient algorithms for 3D Morton ordering
Efficient algorithms for 3D Hilbert ordering
Potential applications in data organization and processing
Abstract
This document describes algorithms for generating general Morton and Hilbert orderings for three-dimensional data volumes.
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
TopicsAdvanced Numerical Analysis Techniques · Rough Sets and Fuzzy Logic · Advanced Clustering Algorithms Research