Timeline for Find the nearest point of a given set of points
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2017 at 12:40 | history | edited | CommunityBot |
replaced http://stackoverflow.com/ with https://stackoverflow.com/
|
|
| Feb 21, 2017 at 2:03 | vote | accept | Lin Ma | ||
| Feb 21, 2017 at 2:03 | comment | added | Lin Ma | Thanks sds. I mark your reply as answer to appreciate all of your good points here and the learning from you. I start a new post (codereview.stackexchange.com/questions/155893/…), which adopt your advice of using bounding box/envelop algorithm, if you could have time to comment and continue to discuss there, it will be great. | |
| Feb 21, 2017 at 1:45 | history | edited | sds | CC BY-SA 3.0 |
clarify
|
| Feb 21, 2017 at 1:39 | comment | added | sds | you are overly conservative. If you follow the rule of thumb and your boxes are well populated, you might need to check only one box. I will clarify my edit. | |
| Feb 21, 2017 at 1:32 | comment | added | Lin Ma | Thanks sds, but for your comments -- "for each new point you only need to check 4 boxes", I think I need to check 9 boxes, the box the point fall into, the all 8 neighbor (left, right, up, down, top-left, top-right, bottom-left and bottom-right)? Why you think 4 of them are enough? | |
| Feb 21, 2017 at 1:12 | comment | added | sds | did you read the edit? | |
| Feb 21, 2017 at 1:02 | comment | added | Lin Ma | Yes, sds. Any new idea to resolve this issue in a smarter way, without brute force compare min distance? | |
| Feb 20, 2017 at 15:06 | history | edited | sds | CC BY-SA 3.0 |
add PS
|
| Feb 20, 2017 at 0:58 | history | edited | sds | CC BY-SA 3.0 |
add envelopes/boxes
|
| Feb 20, 2017 at 0:52 | comment | added | sds | I see. You have a huge pool of points and a stream of inputs what must be matched with the pool. right? | |
| Feb 20, 2017 at 0:50 | comment | added | Lin Ma | Thanks sds, vote up. My specific question is, if the set of candidate nearest neighbor points are fixed (but the input point are different), how to optimize? I think your code does not help if input points are different from each time? | |
| Feb 20, 2017 at 0:16 | history | answered | sds | CC BY-SA 3.0 |