Timeline for An algorithm for finding the closest point to a fixed point. [closed]
Current License: CC BY-SA 2.5
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 17, 2011 at 23:57 | vote | accept | faustlin | ||
| Feb 17, 2011 at 23:57 | |||||
| Feb 16, 2011 at 9:59 | history | closed | S. Carnahan♦ | too localized | |
| Feb 16, 2011 at 9:59 | comment | added | S. Carnahan♦ | Without further elaboration, this question does not seem appropriate for MathOverflow. The literal answer to your question is "yes" since you can save a little time by only calculating the squares of distances. This can be implemented easily with MATLAB vector manipulation. | |
| Feb 16, 2011 at 4:28 | comment | added | Gerhard Paseman | Brian, indeed. Since the poster has provided little motivation, all I will do is suggest an alternative. The poster will have to judge if the alternative is suitable. If the poster gives more, I will be happy to suggest a better fitting alternative. Gerhard "Will Go Only So Far" Paseman, 2011.02.15 | |
| Feb 16, 2011 at 4:11 | answer | added | Bhalchandra D Thatte | timeline score: 0 | |
| Feb 16, 2011 at 3:44 | comment | added | Brian Borchers | The Veroni diagram is useful if you have a large collection of fixed points and are then going to find the nearest one of these fixed points for many other points, but the work to compute the Voroni diagram can't be amortized if you only need to do the nearest neighbor calculation once. | |
| Feb 16, 2011 at 3:30 | comment | added | Gerhard Paseman | Voronoi diagram. That and computational geometry are good search terms. Gerhard "Ask Me About System Design" Paseman, 2011.02.15 | |
| Feb 16, 2011 at 2:53 | answer | added | Brian Borchers | timeline score: 2 | |
| Feb 16, 2011 at 2:29 | history | asked | faustlin | CC BY-SA 2.5 |