Difference between revisions of "Thread:User talk:Jdev/Code/R Tree/Performance?/reply (3)"
Jump to navigation
Jump to search
(Reply to Performance?) |
(No difference)
|
Latest revision as of 11:50, 21 December 2011
I did the exactly same. Something like this: E[] arr1 = rTree.rangeSearch(getRange(currentLoc)); E[] arr2 = kDTree.nearestNeighbor(currentLoc, arr1.length)
