I implemented a morton/z-order curve, and implemented the LITMAX/BIGMIN: https://en.wikipedia.org/wiki/Z-order_curve#Use_with_one-dimensional_data_structures_f

I implemented a morton/z-order curve, and implemented the LITMAX/BIGMIN: https://en.wikipedia.org/wiki/Z-order_curve#Use_with_one-dimensional_data_structures_for_range_searching https://en.wikipedia.org/wiki/Z-order_curve#Use_with_one-dim... It helps implement spatial partitioning with a z-order curve, which makes spatial partitioning quite fast and easy to implement compared to R-tree, quad tree, KD tree and other sophisticated things. The wikipedia article doesn't mention if it's under patent, and some link says the patent was dropped, but I am not sure. https://patents.google.com/patent/DE10331679A1/en https://patents.google.com/patent/DE10331679A1/en I don't really know how to read this, and there are other results to "LITMAX/BIGMIN patent". Although, to be quite honest, I don't think there is a good benchmark of spatial partitioning algorithms (like there is for hash tables), since it's often comparing apples/orange/bananas.