Answer the question
In order to leave comments, you need to log in
Is it possible to use the Yandex Maps API to calculate the points closest to the entire path of the constructed route within an n-km radius?
I dug into the documentation for the API, but did not find anything similar. Perhaps there are some options for implementing it?
How can such a problem be solved?
I know a little about finding the nearest points on the sphere, but maybe this is not enough and there are some formulas for this?
I would be very grateful for any hints.
UPD:
I'm thinking about getting route segments with coordinates (a limited list of segments, say, every 2-3 or 50-100 segments, depending on their total number) and searching for the nearest points in a circle or even on a square using these coordinates. Won't take off?
UPD1:
The very task I'm trying to solve:
- there are a number of delivery points in the database with two fields for coordinates (lat, lon).
- the user specifies a point from and to, for example, two cities, for example, let's take Moscow and St. Petersburg.
- the system should find the delivery points available in the database between these two points and show them in a list and display on the map
Thank you.
Answer the question
In order to leave comments, you need to log in
Didn't find what you were looking for?
Ask your questionAsk a Question
731 491 924 answers to any question