John, great suggestion. I ended up using the GDouglasPeucker class in here http://www.bdcc.co.uk/Gmaps/GDouglasPeuker.js <http://www.bdcc.co.uk/Gmaps/GDouglasPeuker.js>which I downloaded off this page: http://www.bdcc.co.uk/Gmaps/Services.htm
<http://www.bdcc.co.uk/Gmaps/Services.htm>By playing around with the kink level, I was able to find the sweet spot where it's not to inaccurate, and not too slow. Thanks!! Dan On Fri, Jul 24, 2009 at 5:45 PM, Maps.Huge.Info (Maps API Guru) < [email protected]> wrote: > > How about looking at it another way? > > If you simplify your polygons using Douglas-Peucker, you could do > exactly the same thing. Mark McClur used a slightly different > simplification routine in his example but D-P works fine as well. > There are several flavors of polygon/polyline simplification that > eliminate redundant points yet leave the essential shape of the > geometry. > > Here's a D-P routine in Perl: > > http://www.usnaviguide.com/douglas-peucker.htm > > -John Coryat > > http://maps.huge.info > > http://www.usnaviguide.com > > http://www.zipmap.net > > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
