Timothy Lochner

This makes me wonder about a few things. First, would this sort of search be good for ranged searches? Ie, for a random set of 50 numbers between 0 and 99, return al values between 40 and 60 (as begin/end indices).

My natural next thought is wondering if/how this might work in higher dimensions (if you consider your examples to be 1D). Is there an analogous structure in those higher dimensions that lets me find all objects in an AABB overlap?

And more importantly, could such a structure be worthwhile, from a performance standpoint?

I'm trying to think of how it could work in higher dimensions and one thing I'm thinking of is maybe something like this could be good for finding the shape (boundary) of a local minimum. Not sure what that'd be good for specifically but fitting a surface or hyper volume to data