TOPICS
Search

Convexity Coefficient


The convexity coefficient chi(D) of a planar region D of finite positive area is the probability that the line segment connecting two independently and uniformly chosen points in D is contained entirely within D. For a convex region, chi(D)=1.

Let A_D(P) denote the area of the part of D visible from a point P in D, and let A_D be the area of D. Then

 chi(D)=1/(A_D^2)intint_DA_D(x,y)dxdy

(Hodge et al. 2010).

The convexity coefficient is in general hard to compute exactly for concave regions even of simple shape. One closed form is that of an annulus with inner radius b and outer radius a, where a>0 and 0<=b<a, which has

 chi=(2a^2cos^(-1)(b/a)-2bsqrt(a^2-b^2))/(pi(a^2-b^2))

(Hodge et al. 2010).


See also

Convex, Convex Polygon, Convex Polyhedron

Explore with Wolfram|Alpha

References

Hodge, J.; Marshall, E.; and Patterson, G. "Gerrymandering and Convexity." Coll. Math. J. 41, 312-324, 2010.

Referenced on Wolfram|Alpha

Convexity Coefficient

Cite this as:

Weisstein, Eric W. "Convexity Coefficient." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/ConvexityCoefficient.html

Subject classifications