Given a non-self-intersecting polygon made of straight segments how do you detect/trim sections of the polygon that are "thin"?
If an algorithm exists for this, then great! If not, then...
- I think the "correct" definition of "thickness" at a point on the edge is related to the smallest circle that touches that edge and some other part of the polygon.
- The thickness at the point where two lines meet is always zero so there will need to be some minimum allowed angle.
As for the algorithm.. some sort of checking every line against every other line? Some sort of convert to convex hulls first? Some sort of triangulation of the polygon?