p-Adic scaled space filling curve indices for high dimensional data

by   Patrick Erik Bradley, et al.

Space filling curves are widely used in Computer Science. In particular Hilbert curves and their generalisations to higher dimension are used as an indexing method because of their nice locality properties. This article generalises this concept to the systematic construction of p-adic versions of Hilbert curves based on affine transformations of the p-adic Gray code, and develops an efficient scaled indexing method for data taken from high-dimensional spaces based on these new curves, which with increasing dimension is shown to be less space consuming than the optimal standard static Hilbert curve index. A measure is derived which allows to assess the local sparsity of a data set, and is tested on some data.


page 1

page 2

page 3

page 4


Aztec curve: proposal for a new space-filling curve

Different space-filling curves (SFCs) are briefly reviewed in this paper...

A scaled space-filling curve index applied to tropical rain forest tree distributions

In order to be able to process the increasing amount of spatial data, ef...

Representing Whole Slide Cancer Image Features with Hilbert Curves

Regions of Interest (ROI) contain morphological features in pathology wh...

Hilbert Distillation for Cross-Dimensionality Networks

3D convolutional neural networks have revealed superior performance in p...

Online Obstacle evasion with Space-Filling Curves

The paper presents a strategy for robotic exploration problems using Spa...

Onion Curve: A Space Filling Curve with Near-Optimal Clustering

Space filling curves (SFCs) are widely used in the design of indexes for...

Hinged Truchet tiling fractals

This article describes a new method of producing space filling fractal d...

Please sign up or login with your details

Forgot password? Click here to reset