Difference between revisions of "Thread:User talk:Jdev/Jdev's R-Tree/reply"
Jump to navigation
Jump to search
m (Reply to Jdev's R-Tree) |
(No difference)
|
Latest revision as of 10:27, 18 September 2014
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.
