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)
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 (9).
Good point about the minimum bounding rectangles. Thinking about it some more, I suspect that the RS speed of a kd-tree that uses minimum bounding rectangles, would be extremely similar to that of a R-tree really. Sure, the partitioning is a bit different but both have reasonable enough partitioning and with the minimum bounding rectangles the search algorithm would basically be the same.
Yeah, that rebalancing aspect is what prompted me to do some r-tree experiments in the past.
