Jdev's R-Tree

Jump to navigation Jump to search
Revision as of 18 September 2014 at 08:39.
The highlighted comment was created in this revision.

Jdev's R-Tree

How fast is your R-Tree Jdev? and would it be possible for Skilgannon to create a faster R-Tree? The only range search comparision possible is Chase's Kd-Tree, to Jdev's R-Tree.

    Tmservo (talk)‎08:41, 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.

      Jdev (talk)‎09:27, 18 September 2014

      Here is that discussion

        Jdev (talk)‎09:39, 18 September 2014
         
         
        Retrieved from "http://robowiki.net/wiki/Thread:User_talk:Jdev/Jdev%27s_R-Tree"