Question: Why there is parameters verification that point dimension must be at least 2? about rstar HOT 3 CLOSED

Could you explain more about what you're trying to achieve? Preferably with a minimal reproducible example. I mostly work with geometries in R2, so I have to admit that I simply don't understand the phrase "points that could have a single dimension".

from rstar.

I'm not sure it makes sense to use an RTree for less than 2 dimensions.

If I wanted to efficiently insert and query over a 1 dimensional range, I think I'd use a btree:

https://doc.rust-lang.org/stable/std/collections/struct.BTreeMap.html#method.range

Or do you mean that your points will be a mix of 1 and 2(+) dimensions?

from rstar.

I am working with a program that works with problems could be set in different dimensions - I just want to solve all situation with the same piece of code. It's right that btree or other solution is better for one dimensional problem. And I have found the crate that is more suitable for me (kd_tree)

from rstar.