Timeline for Data structure to store sphere points (latitude,longitude) and retrieve all points within a distance
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 26, 2021 at 7:44 | comment | added | Nicolas Raoul |
@PMende: Good remark, however the question mentions that d is orders of magnitude smaller than the Earth's radius r so it should be acceptable.
|
|
| Jan 29, 2020 at 17:07 | comment | added | vonbrand | @PMende, true. But the distance on the sphere is monotonic on linear distance. | |
| Jan 20, 2020 at 21:58 | comment | added | PMende | Just wanted to point out that this answer is simply incorrect. The constrained distance between two points on a sphere (i.e., their distance when you are forced to move along the surface of the sphere) is larger than their straight-line distance you would get from calculating their Euclidean distance. This is easier to see if you consider the simpler case of 2 points on a circle. | |
| Jan 8, 2016 at 18:01 | history | edited | D.W.♦ | CC BY-SA 3.0 |
added 8 characters in body
|
| Jan 8, 2016 at 16:02 | comment | added | vonbrand | @NicolasRaoul, you can e.g. sort the points by one of the coordinates to reduce it to a binary search. | |
| Jan 8, 2016 at 15:15 | comment | added | Nicolas Raoul | In 3D! I see, that's doable then. I would still mean calculating for each point of the set, but each calculation would be faster indeed. | |
| Jan 8, 2016 at 13:52 | history | answered | vonbrand | CC BY-SA 3.0 |