Range search in Multi_dimensional R-Trees

Question

I am trying to implement R-Tree in C++. While implementing Range Queries, I find that I have to check for the intersection of a point (with a given range), with a multi-dimensional hyper rectangle.

Any idea how this could be done? For 2D case I know, but how to do it for N-Dimensional Case?

Micromega · Answer 1 · 2015-02-26T19:13:23.317

0

You can try a morton curve treat the co-ordinates as a binary and interleave it. Then treat the number as base-4. Then search it from left to right.

edited Feb 26 '15 at 19:13

answered Feb 24 '15 at 18:37

Micromega

12,486
7
35
72

score 0 · Answer 2 · answered Feb 24 '15 at 19:24

0

Exactly as in the 2d case.

just use a loop.

answered Feb 24 '15 at 19:24

Has QUIT--Anony-Mousse

76,138
12
138
194

@Anony-mouse:How does it look like? Maybe a grey code? – Micromega Feb 24 '15 at 20:33
No, *much* much easier. See: you are talking about *rectangles*. Not hilbert curved. – Has QUIT--Anony-Mousse Feb 24 '15 at 20:51
@Anony-Mouse:I talk about boxes. – Micromega Feb 24 '15 at 21:07
The intersection of axis aligned boxes is ... a box. Seriously, you only need "min" and "max". – Has QUIT--Anony-Mousse Feb 24 '15 at 21:08

Range search in Multi_dimensional R-Trees

2 Answers2