Z
Z
ZaptoS2016-02-16 01:20:19
MongoDB
ZaptoS, 2016-02-16 01:20:19

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

1 answer(s)
L
lega, 2016-02-16
@lega

There are no such algorithms in the database.
In theory, you can try to calculate the "proximity" of 2 routes like this: "connect" the beginning and end of the routes - make a closed figure and calculate the area, the smaller the area - the "closer" the routes.

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question