Suppose $R$ is some planar region, bounded by a curve. Let $C_1$ be the centroid of $R$, and let $C_2$ be the center of the "circumcircle" (the smallest circle enclosing $R$). Intuitively, it seems that $C_1$ and $C_2$ ought to be fairly close together.
But how close? Can we find a bound $d$ on the distance between $C_1$ and $C_2$?
Assume that $R$ is a polygon, if that helps (I can always replace the boundary curve by an approximating polygon).
Assume that $R$ is convex, if that allows us to obtain a smaller bound (I can replace R by its convex hull).
Why does this matter? I really want the circumcircle, but computing it is quite difficult (yes, I know algorithms exist, but they're fairly complicated). I'm looking for a decent approximation that's easy to compute. So, the idea is:
- Estimate $d$ (hence the question above)
- Find the centroid $C_1$ (easy)
- Compute the maximum distance $M$ from $C_1$ to the boundary curve (easy)
- The circle with center $C_1$ and radius $M+d$ encloses $R$. Done.
Here is a somewhat related question (with no answers).
Edit
If $R$ is a semi-circular region of radius $r$, then $d=4r/3\pi \approx 0.42*r$. I'm guessing that's the worst case for convex shapes.
If we don't assume that $R$ is convex, then I can put a fat blob of $R$ over on one side of the circumcircle, and an infinitely thin tentacle snaking over to the other side. By doing this, maybe I can make $d$ arbitrarily close to the radius of the circumcircle..