Performance?
Fragment of a discussion from User talk:Jdev/Code/R Tree
← Thread:User talk:Jdev/Code/R Tree/Performance?/reply (9)
Jump to navigation
Jump to search
← Thread:User talk:Jdev/Code/R Tree/Performance?/reply (9)
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
You do not have permission to edit this page, for the following reasons:
You can view and copy the source of this page.
Return to Thread:User talk:Jdev/Code/R Tree/Performance?/reply (10).
