On May 2, 7:27 am, René <[email protected]> wrote: > I was wondering, is anyone aware of an algorithm for reducing the > complexity of a polyline (as it's expressed in so many hundreds of lat/ > lng waypoints)? For example, given 100 waypoints describing a fairly > round circle...
There is also this Perl version of the encoder, written by John Coryat and myself, which applies the Douglas-Peucker reduction algorithm before encoding the line: http://www.usnaviguide.com/google-encode.htm -- Marcelo - http://maps.forum.nu -- --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Google Maps API" 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-API?hl=en -~----------~----~----~----~------~----~------~--~---
