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.
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?
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.Jdev (talk)
Here's some words to use ctrl f on to help you remember
Rtree CHILDREN_COUNT RTree parent Attribute dimensions IntervalDouble coveredRange RTreeEntry RTreeEntry entries nextEntryIdx RTree children nextChild Intersection intersection splitDimensionIdx singular entryCount TurnSnapshot location