Expand description
Hilbert-packed R-tree bulk loader + read-only tree.
Tiles in a NodeDB array segment are already written in Hilbert order
(the segment writer appends them in order of tile_id.hilbert_prefix).
That means consecutive TileEntrys are spatially clustered, so a
packed R-tree built by simple chunking yields tight, well-formed
leaves with zero spatial sorting work. Each leaf groups
FANOUT consecutive tiles; internal levels group FANOUT
children, recursively, until a single root remains.
Structs§
- Hilbert
PackedR Tree - Read-only Hilbert-packed R-tree over a segment’s tile MBRs.
Constants§
- FANOUT
- Branching factor. 16 keeps internal nodes cache-friendly while matching typical leaf-tile-per-node ratios for genomic / EO scale.