Reply
Sun 29 Apr, 2012 11:23 am
Trying to find the minimal width of a polygon as described as any point on any line, connected to any other point on any other line without going outside the shape, or across a hole. This must work for Convex, Concave, and polygons with holes. The shapes are presented as bezier curves.
This is easy to do visually, but I can't imagine any kind of method that would be effeicient, as lines and curves contain an infinite number of points.
@inkexit,
I suggest that you Google "convex hull". I also suggest that you ignore the case of polygons with holes in them: Adding a hole to a polygon does not affect its minimal width.