Value Members

1.  object MaximumInscribedCircle

   Constructs the Maximum Inscribed Circle for a polygonal {link Geometry}, up to a specified tolerance.

   Constructs the Maximum Inscribed Circle for a polygonal {link Geometry}, up to a specified tolerance. The Maximum Inscribed Circle is determined by a point in the interior of the area which has the farthest distance from the area boundary, along with a boundary point at that distance.

   In the context of geography the center of the Maximum Inscribed Circle is known as the Pole of Inaccessibility. A cartographic use case is to determine a suitable point to place a map label within a polygon.

   The radius length of the Maximum Inscribed Circle is a measure of how "narrow" a polygon is. It is the distance at which the negative buffer becomes empty.

   The class supports polygons with holes and multipolygons.

   The implementation uses a successive-approximation technique over a grid of square cells covering the area geometry. The grid is refined using a branch-and-bound algorithm. Point containment and distance are computed in a performant way by using spatial indexes.

   Future Enhancements

   • Support a polygonal constraint on placement of center