<br><font size=2 face="sans-serif">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.</font>
<br>
<br><font size=2 face="sans-serif">Thanks,</font>
<br><font size=2 face="sans-serif">Joe Miller</font>