Hey- Joseph Miller wrote: > > In February of 2008 Tim Schaub sent an email about a patch in his > sandbox that used a minkowski sum (I think) to create a client-side > buffer. The end results typically had self-intersections. He mentioned > that an upgraded version(as an external library) might be on the way > that included polygon simplification to remove the self-intersection. > Does anyone if this was ever released? If not, does anyone have any > suggestions for an algorithm that could remove self-intersection? I > don't think convex hulls would work because I think the resulting buffer > would lose all detail. Sorting the vertices clockwise using atan2 > didn't work either. >
Though I am interested in working on it, it hasn't become a work priority since I made that comment. I would be interested in talking more about what you're working on. Tim > Thanks, > Joe Miller > > > ------------------------------------------------------------------------ > > _______________________________________________ > Users mailing list > [email protected] > http://openlayers.org/mailman/listinfo/users -- Tim Schaub OpenGeo - http://opengeo.org Expert service straight from the developers. _______________________________________________ Users mailing list [email protected] http://openlayers.org/mailman/listinfo/users
