Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

I think you can find the maximum enclosed circle using the minEnclosingCircle function and a geometric inversion

First you need to know a point P which you define to be in the circle you seek, for example the centroid of your polygon.
(If you do not have a point which you define to be inside the maximum enclosed circle, then I believe there is no unique solution)

  • do an inversion around an arbitrary circle with the center P,
  • then find the minimum enclosing circle for your inverted points
  • then undo the inversion

The inverse of your minimum enclosing circle should now be a maximum enclosed circle for the original points.

I think you can find the maximum enclosed circle using the minEnclosingCircle function and a geometric inversion

First you need to know a point P which you define to be in the circle you seek, for example the centroid of your polygon.
(If you do not have a point which you define to be inside the maximum enclosed circle, then I believe there is no unique solution)are arbitrarily many solutions)

  • do an inversion around an arbitrary circle with the center P,
  • then find the minimum enclosing circle for your inverted points
  • then undo the inversion

The inverse of your minimum enclosing circle should now be a maximum enclosed circle for the original points.

This will only find the maximum enclosed circle for the pointset though, not for the polygon, so if your polygon is self-intersecting or has an otherwise complicated shape, this will not give the desired results