Search Region Question

[Sam Mason]

When talking about range searches in k-d trees and range trees, the
notes label the desired search region as [lo_x,hi_x] x [lo_y, hi_y].
By their labels, these wouldn't make sense if they were written as
points; wouldn't it be [lo_x, lo_y] x [hi_x, hi_y]? Does this mean the
labels are inaccurate, or they aren't actually written as points? I'm
guessing it's the latter, but just want to make sure. Also, would the
same format go for when we are talking about the range of a node as
(a,b] x (c,d] in the k-d tree case?

[cs240]

The lables [lo_x, hi_x] * [lo_y, hi_y] represent the search region R, not
the points. [lo_x, hi_x] represents the length of R and [lo_y, hi_y]
represents the width(height) of R. And yes, the range of a node is defined
the same way in the kd-tree case.

Vivian

Post by Sam Mason
When talking about range searches in k-d trees and range trees, the
notes label the desired search region as [lo_x,hi_x] x [lo_y, hi_y].
By their labels, these wouldn't make sense if they were written as
points; wouldn't it be [lo_x, lo_y] x [hi_x, hi_y]? Does this mean the
labels are inaccurate, or they aren't actually written as points? I'm
guessing it's the latter, but just want to make sure. Also, would the
same format go for when we are talking about the range of a node as
(a,b] x (c,d] in the k-d tree case?