Related papers: How many three-dimensional Hilbert curves are ther…
Hilbert's two-dimensional space-filling curve is appreciated for its good locality properties for many applications. However, it is not clear what is the best way to generalize this curve to filling higher-dimensional spaces. We argue that…
This article describes sixteen different ways to traverse d-dimensional space recursively in a way that is well-defined for any number of dimensions. Each of these traversals has distinct properties that may be beneficial for certain…
Space-filling curves like the Hilbert-curve, Peano-curve and Z-order map natural or real numbers from a two or higher dimensional space to a one dimensional space preserving locality. They have numerous applications like search structures,…
The paper presents a systematic strategy for implementing Hilbert's space filling curve for use in online exploration tasks and addresses its application in scenarios wherein the space to be searched obstacles (or holes) whose locations are…
In this paper we introduce an algorithm of construction of cyclic space-filling curves. One particular construction provides a family of space-filling curves in all dimensions (H-curves). They are compared here with the Hilbert curve in the…
This paper introduces a new way of generalizing Hilbert's two-dimensional space-filling curve to arbitrary dimensions. The new curves, called harmonious Hilbert curves, have the unique property that for any d' < d, the d-dimensional curve…
The goal of load balancing (grid partitioning) is to minimize overall computations and communications, and to make sure that all processors have a similar workload. Geometric methods divide a grid by using a location of a cell while…
We investigate tensor network simulations of the two-dimensional Hubbard model by mapping the lattice onto a one-dimensional chain using space-filling curves. In particular, we focus on the Hilbert curve, whose locality-preserving structure…
Homogeneous Hilbert curves (HHC) in two dimensions are generalized by introducing the construction of the space filling curves from the same affine transformations but using an arbitrary kernel, we call such curves HHCK. The new curves are…
We describe Hilbert's spacefilling curve in several different ways: as an automatic sequence of directions,as a regular and synchronized sequence of coordinates of lattice points encountered, and as an automatic bitmap image.
We investigate the Hilbert scheme of points on curves with n-fold singularities, that is curves that look locally around their singular points as the axis in an affine space. We describe the structure and number of its irreducible…
Landscape analysis aims to characterise optimisation problems based on their objective (or fitness) function landscape properties. The problem search space is typically sampled, and various landscape features are estimated based on the…
We present a complete classification of the geometry of the mutually complementary sets of entangled and separable states in three-dimensional Hilbert subspaces of bipartite and multipartite quantum systems. Our analysis begins by finding…
An inventory of all possible homogenous Hilbert curves in two dimensions are reported. Six new Hilbert curves are described by introducing the reversion operation in the construction algorithm. For each curve, the set of affine…
We describe the Hilbert schemes parametrizing curves on a cubic threefold of degree at most 5. In a forthcoming paper, we use this description to give a new proof and extension of a theorem of Iliev, Markushevich and Tikhimirov.
This paper addresses the problem of exploring a region using the Hilbert's space-filling curve in the presence of obstacles. No prior knowledge of the region being explored is assumed. An online algorithm is proposed which can implement…
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…
Generating Hilbert curves in Z^2 using L-systems appears to be efficient and easy
Most research into similarity search in metric spaces relies upon the triangle inequality property. This property allows the space to be arranged according to relative distances to avoid searching some subspaces. We show that many common…
We study the reciprocal position of nine points in the plane, according to their collinearities. In particular, we consider the case in which the nine points are contained in an irreducible cubic curve and we give their classification. If…