Performance?
Fragment of a discussion from User talk:Jdev/Code/R Tree
Jump to navigation
Jump to search
I did the exactly same. Something like this: E[] arr1 = rTree.rangeSearch(getRange(currentLoc)); E[] arr2 = kDTree.nearestNeighbor(currentLoc, arr1.length)
Jdev
