Timeline for Finding N nearest points to point using JTS?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:33 | history | edited | CommunityBot |
replaced http://gis.stackexchange.com/ with https://gis.stackexchange.com/
|
|
| Aug 19, 2015 at 1:40 | comment | added | Boo | Thanks for your help, i'll look into kd tree implementations for java. I know JTS has a kd tree, although no nearest neighbors method. I see there is no delete method but I can insert and overwrite nodes in the tree so that's just as good. | |
| Aug 19, 2015 at 1:35 | vote | accept | Boo | ||
| Aug 19, 2015 at 0:56 | comment | added | dmahr |
+1 for k-d tree. I don't know about Java implementations, but the Python/C implementation in scipy.spatial.cKDTree is insanely fast, ever for 100 nearest neighbors to a couple hundred thousand points.
|
|
| Aug 19, 2015 at 0:29 | history | answered | blah238 | CC BY-SA 3.0 |