Compact Hilbert indices: space-filling curves for domains with unequal side lengths
From MaRDI portal
Publication:2380065
DOI10.1016/J.IPL.2007.08.034zbMATH Open1184.68032OpenAlexW2157953951WikidataQ56700189 ScholiaQ56700189MaRDI QIDQ2380065FDOQ2380065
Authors: Chris H. Hamilton, Andrew Rau-Chaplin 
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.08.034
Recommendations
Cites Work
- Algorithm 781
- SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion
- Spacefilling curves and the planar travelling salesman problem
- Alternative Algorithm for Hilbert's Space-Filling Curve
- The number of bit comparisons used by Quicksort, an average-case analysis
- Convergence with Hilbert's space filling curve
- Vertex-labeling algorithms for the Hilbert spacefilling curve
- Improving memory hierarchy performance for irregular applications using data and computation reorderings
Cited In (11)
- One machine, one minute, three billion tetrahedra
- Computing space-filling curves
- Reordering columns for smaller indexes
- An arithmetic-analytical expression of the Hilbert-type space-filling curves and its applications
- Towards optimal locality in mesh-indexings
- Four-dimensional Hilbert curves for R-trees
- On integration methods based on scrambled nets of arbitrary size
- Developments of encoding and decoding algorithms for high dimensional Hilbert curves
- Towards optimal locality in mesh-indexings
- On the Quality of Partitions Based on Space-Filling Curves
- Network Voronoi diagram on uncertain objects for nearest neighbor queries
Uses Software
This page was built for publication: Compact Hilbert indices: space-filling curves for domains with unequal side lengths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380065)
