Answer the question
In order to leave comments, you need to log in
How to find the closest routes to a given one?
Good night everybody! The following question is of interest:
1) there is a given route built on points, say, there are 50 of them
2) there is a base of routes built on points with an arbitrary number of them
3) I want to define the concept of "proximity" of routes. Without considering the intersection of route segments as a sign of "proximity", are there any algorithms that allow not to check through withinCircle with a given radius (for example) each route point from point 1 for intersection with other routes?
Thanks in advance!
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