encode_hilbert_zero: Computes an integer Hilbert index for x and y using a variant...
In dd-harp/globalrc: Computes Control Reproductive Number, Rc, from PfPR and Treatment Levels
Description
Usage
Arguments
Value
Description
Computes an integer Hilbert index for x and y using a variant algorithm.
Usage
1
encode_hilbert_zero(x, y)
Arguments
x
An integer x-axis value, 0-based.
y
An integer y-axis value, 0-based.
Value
A hilbert z-value, an integer.
Given two integer indices for a 2-dimensional plane, return a single index.
This index is designed to increase locality for 1-dimensional access.
It does this by keeping nearby points in 2 dimensions also nearby in
1 dimension.
The variant algorithm used differs from the usual Hilbert code because it
doesn't need to know the size of the whole grid before computing the code.
It looks like a slightly-rotated version of the Hilbert curve, but it
has the benefit that it is 1-1 between (x, y) and z, so you can translate
back and forth.
This function is zero-based. 0 <= x < 2^n, 0 <= y < 2^n, and the result
is 0 <= z < 4^n.
N. Chen, N. Wang, B. Shi, A new algorithm for encoding and decoding the
Hilbert order. Software—Practice and Experience 2007; 37(8): 897–908.
See also: decode_hilbert_zero, encode_hilbert.
dd-harp/globalrc documentation built on Sept. 20, 2021, 12:31 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value
Description
Computes an integer Hilbert index for x and y using a variant algorithm.
Usage
1 | encode_hilbert_zero(x, y)
|
Arguments
x |
An integer x-axis value, 0-based. |
y |
An integer y-axis value, 0-based. |
Value
A hilbert z-value, an integer.
Given two integer indices for a 2-dimensional plane, return a single index.
This index is designed to increase locality for 1-dimensional access.
It does this by keeping nearby points in 2 dimensions also nearby in
1 dimension.
The variant algorithm used differs from the usual Hilbert code because it
doesn't need to know the size of the whole grid before computing the code.
It looks like a slightly-rotated version of the Hilbert curve, but it
has the benefit that it is 1-1 between (x, y) and z, so you can translate
back and forth.
This function is zero-based. 0 <= x < 2^n, 0 <= y < 2^n, and the result
is 0 <= z < 4^n.
N. Chen, N. Wang, B. Shi, A new algorithm for encoding and decoding the Hilbert order. Software—Practice and Experience 2007; 37(8): 897–908.
See also: decode_hilbert_zero, encode_hilbert.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.