Performance?

Jump to navigation Jump to search

I completely agree with you. But i think, that r-tree is faster with RS, but kD-tree is faster with kNN

Jdev‎05:32, 22 December 2011

That's an interesting theory, could perhaps be the case. I might test that some time.

Rednaxela‎08:12, 22 December 2011
 

I think that range searches would definitely be faster using R-trees. In a range search, you could add every point within the rectangle of an R-tree without calculating any distances for those points. Of course, your tree uses minimum bounding rectangles so you could do that too, but a normal kd-tree couldn't. For a kNN search the main advantage of an R-tree is probably the ease with which you can rebalance the tree.

AW‎17:53, 22 December 2011

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/Code/R Tree/Performance?/reply (10).

 
 
Retrieved from "http://robowiki.net/wiki/Thread:User_talk:Jdev/Code/R_Tree/Performance%3F/reply_(7)#Performance.3F_464"