Titan's blog

Kd-Tree Bounding Rect
By Titan, 10 years ago, In English

I need help , i want solve this problem, how much points lies inside of rectangle, using a kd-tree, input: S = set of points, |S| <= 5*10^5, 10^5 queries(rectangles).

  • Vote: I like it
  • -8
  • Vote: I do not like it

»
10 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

offline or online? anyway, easy with segment tree

→ Reply
  • »
    »
    10 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I think his question is in K dimension space, that's why Kd-tree is asked.

    → Reply