If that were so simple, there would the following extremely fast overall algorithm: Select a point in the "middle" and solve the two problems separately. Now continue to do that recursively.
Episteme PROMENEUR <episteme.promen...@gmail.com> schrieb am Fr., 27. März 2020, 19:30: > > > >> >> > After reading all posts I was a bit puzzled and disappointed then i had an > idea. > > Osmand advises cutting in several routes of 250 km our itinerary, Right ? > > Then I asked for Osmand to include their advice in their algorithm. > > See > > https://github.com/osmandapp/Osmand/issues/8721 > > -- > You received this message because you are subscribed to the Google Groups > "OsmAnd" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to osmand+unsubscr...@googlegroups.com. > To view this discussion on the web visit > https://groups.google.com/d/msgid/osmand/fbb5ad68-8570-4f28-99ed-e4733ca464f9%40googlegroups.com > <https://groups.google.com/d/msgid/osmand/fbb5ad68-8570-4f28-99ed-e4733ca464f9%40googlegroups.com?utm_medium=email&utm_source=footer> > . > -- You received this message because you are subscribed to the Google Groups "OsmAnd" group. To unsubscribe from this group and stop receiving emails from it, send an email to osmand+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/osmand/CA%2BCgGZS%3DE6KQiA9rZKEW7Cgtp4v%2BNT_NSbFVqLo%2BxLF3gfR0pg%40mail.gmail.com.
