http://www.google.com/search?q=polygon+simplification
is a good start :) Douglas-Peucker is one of the more common alogorithms, and there are certainly implementations available in most languages (I've used a PHP one) - there are even JS ones (I think there was one tailured for v2 not sure about v3) On 22 December 2010 11:14, PaulG <[email protected]> wrote: > Hi, > > I have some edited polygons being submitted. > > It is entirely possible for those polygons to contain a point which > lie on a straight line. > > To illustrate my case : if you imagine a square with 4 lines and 4 > points, and on the top line there is a 5th point sitting on that line > with exactly horizontal lines emanating from it - therefore making it > totally useless. > > Does anyone know of an algorithm I could use or adapt for detecting > that unnecessary 5th point? > > I could detect and remove that either in Javascript on the client or > in PHP as I store that Polygon. > > I cannot readily see how I detect the angle that lines come into and > emanate from a point. > > Any pointers gratefully received. > > -- > 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. > > -- 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.
