DGGS.jl

Int64 representation of the cell according to OGC

Bit Layout

3 bits were added in each subsequent resolution to represent i and j coordinates. This determines the cell ordering used for iteration and storage. This linear index is designed to be compact, i.e. all cell numbers from 0 to length(cells)-1 were used. In addition, the resolution is stored in the first 3 significant bits to be unambiguous across different spatial resolutions. The traversing starts at the i coordinates longer side of the first of the 5 sub matrices, going line by line of the same sub matrix. If all points within a sub matrix are visited, it seemingness continuous on the subsequent sub matrix.

Most 3 significant bits: n ∈ [0,4] Next resolution bits: j ∈ [0, 2^resolution-1] Next resolution+1 bits: i ∈ [0, 2*2^resolution-1]

source

DGGS.DGGSDataset Type

Set of DGGSArrays with aligned and shared dimensions at the same resolution.

source

DGGS.DGGSPyramid Type

Set of DGGSDatasets with subsequent spatial refinement levels forming a pyramid

source

DGGS.TileArray Type

ChunkedArray operates just like any AbstractArray, but stores data in chunks. This type is optimized for arrays that are dense in only some regions, but most chunks are just not expected to be filled. In this case, the default value is returned. This is the in-memory variant of Zarr DictStore, but without Compression and slow hash lookup of the Dict. Its ideal for global initialized DGGS arrays that only cover a small spatial region, e.g. a couple of UTM tiles.

source

DGGS.crop Method

Crops the DGGSArray a to the dimensions of another DGGSArray b. Resulting dimensions will be the intersection of those of a and b. Returns a view into a.

source

DGGS.get_geo_bbox Method

Calculate actual geo extent

source

DGGS.get_geo_bbox Method

Infere max possible geo extent

source

DGGS.intersects Method

Determines if hyperrectangle a with dims i, j and n shares area with rectangle b

source

DGGS.to_dggs_array Method

Fast iterative version only supporting mean