Encoding and Decoding Algorithms for Arbitrary Dimensional Hilbert Order

01/06/2016
by   Hui Liu, et al.
0

Hilbert order is widely applied in many areas. However, most of the algorithms are confined to low dimensional cases. In this paper, algorithms for encoding and decoding arbitrary dimensional Hilbert order are presented. Eight algorithms are proposed. Four algorithms are based on arithmetic operations and the other four algorithms are based on bit operations. For the algorithms complexities, four of them are linear and the other four are constant for given inputs. In the end of the paper, algorithms for two dimensional Hilbert order are presented to demonstrate the usage of the algorithms introduced.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/10/2023

Algorithms for 3D Hilbert Encoding and Decoding

This paper presents algorithms and pseudocode for encoding and decoding ...
research
11/03/2020

Function values are enough for L_2-approximation: Part II

In the first part we have shown that, for L_2-approximation of functions...
research
05/11/2021

Two novel feature selection algorithms based on crowding distance

In this paper, two novel algorithms for features selection are proposed....
research
02/03/2010

K-Dimensional Coding Schemes in Hilbert Spaces

This paper presents a general coding method where data in a Hilbert spac...
research
08/06/2022

Oberwolfach report : Discretization of Hilbert complexes

The report is based on an extended abstract for the MFO workshop "Hilber...
research
07/14/2011

A Hilbert Scheme in Computer Vision

Multiview geometry is the study of two-dimensional images of three-dimen...
research
11/16/2020

Several self-adaptive inertial projection algorithms for solving split variational inclusion problems

This paper is to analyze the approximation solution of a split variation...

Please sign up or login with your details

Forgot password? Click here to reset