I am not sure if this is what you are looking for, but try the "Douglas-Peucker algorithm" http://facstaff.unca.edu/mcmcclur/GoogleMaps/EncodePolyline/
kind regards Trevor Seaman On Sep 10, 8:16 pm, Quy Le <[email protected]> wrote: > There are many algorithms to find the shortest path as A *, > Dijkstra, ... > But I don't know what algorithm is used to find the shortest path > between two points in the service Direction? -- You received this message because you are subscribed to the Google Groups "Google Maps JavaScript API v3" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/google-maps-js-api-v3?hl=en.
