b tree - When calculating Z Order, how does one implement BIGMIN and LITMAX for more than 2 dimensions? -

i'm writing ub tree fun using z order curve. capable of storing points in number of dimensions , when queried performs naive search between 2 z indexes, filtering , discarding false positives. implement bigmin , litmax minimize number of false positives traverses, can't seem find information on how implement in way not limit tree storing 2 dimensional data. example, both this whitepaper , this blog post describe implementation in terms heavily tied working 2d values.

is there dimensionality-agnostic way implement functionality?

for 2 dimension can treat z curve base-4 number (quadkey). imo when sort quadkey left right similar litmin , bigmin. n-dimension treat base-n number.