You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
As I understand, inrange currently accepts a radius r which is used to determine if points exist within the hypersphere with radius r. I need to find the points existing within the hyperrectangle ϵ, a vector of the lengths of each dimension of the hyperrectangle.
I wanted to get your thoughts (and any pointers on how to go about implementing this) before I wasted any time.
The text was updated successfully, but these errors were encountered:
Honestly, I don't recall what exactly I was working on at the time. I believe I realized I could do what I needed to do without a hyperrectangle inrange.
This functionality would be useful. Could you @halleysfifthinc re-open the issue, otherwise I have to open a new issue.
I feel embarrassed to write something like this
idx_x = inrange(tree_x, x, dx)
idx_y = inrange(tree_y, y, dy)
#idx = intersect(idx_x, idx_y)
#idx = intersect(Set(idx_x), Set(idx_y))
idx = intersect(BitSet(idx_x), BitSet(idx_y)) # faster that the two above for my use case
As I understand,
inrange
currently accepts a radiusr
which is used to determine if points exist within the hypersphere with radiusr
. I need to find the points existing within the hyperrectangleϵ
, a vector of the lengths of each dimension of the hyperrectangle.I wanted to get your thoughts (and any pointers on how to go about implementing this) before I wasted any time.
The text was updated successfully, but these errors were encountered: