CGAL users discussion list

[Ben Supnik <>]

Hi Y'all,

I'm looking for the right term for an algorithm to determine the largest 
"width" of a polygon.  Colloquially, I want to identify how "thin" a 
polygon is...in other words, I want to identify slivers and long thin 
winding polygons vs. large round areas.

Naively I think I could do an inset using a minkowski sum and if my 
resulting set is empty, I know that no point was "wider" than the 2x the 
diamater of the shape I used for convolution.

Are there metrics or algorithms that compute this kind of value more 
directly?  If anyone has a search term for the type of computational 
geometry problem I'm looking at, a hint would be much appreciated.

cheers
Ben
--
Scenery Home Page: http://scenery.x-plane.com/
Scenery blog: http://xplanescenery.blogspot.com/
Plugin SDK: http://www.xsquawkbox.net/xpsdk/
X-Plane Wiki: http://wiki.x-plane.com/
Scenery mailing list: 

Developer mailing list: