Jdev's R-Tree

Jump to navigation Jump to search

My R-Tree is fast enough for me:) There is on robowiki rough comparsion of range search vs kNN search.
Skilgannon for sure can create faster R-Tree, i think:)
I don't think, that there is fair way to compare speed of R-Tree and KD-Tree, because quite different purpose of them - R-Tree optimised to search for unknown amount of points in strict region, while KD-Tree optimised to search for exact amount of points in unbounded region.

Jdev (talk)10:27, 18 September 2014

Here is that discussion

Jdev (talk)10:39, 18 September 2014

What do CHILDREN_COUNT, and RTreeEntry, each do? Can they be optimized like bucket size? Do you see any optimizations to the R-tree Jdev?

Tmservo (talk)11:06, 18 September 2014

CHILDREN_COUNT - it's split factor, or how many subrectangles will be generated, when current rectangle are overflowed
RTreeEntry... hmmmm... it's entry of range search tree:) It represents data point in turn snapshots space and thing that are added to tree and search for which tree are used.
I think, that CHILDREN_COUNT can be optimised for particular spaces based on theirs natures
I don't know. It was 4 years ago and i do not remember anything

Jdev (talk)11:18, 18 September 2014

You do not have permission to edit this page, for the following reasons:

  • The action you have requested is limited to users in the group: Users.
  • You must confirm your email address before editing pages. Please set and validate your email address through your user preferences.

You can view and copy the source of this page.

Return to Thread:User talk:Jdev/Jdev's R-Tree/reply (5).