TOPICS
Search

Convexity Coefficient


The convexity coefficient chi(D) of a region D is the probability that the line segment connecting two random points in D is contained entirely within D. For a convex region, chi(D)=1.

For D a subset of R^2, let the area of the visible region of a point P be denoted A_D(P), and let the area of D be denoted A_D. Then

 chi(D)=1/(A_D)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 b, 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 Web Resource. https://mathworld.wolfram.com/ConvexityCoefficient.html

Subject classifications