Degree of Convexity and Expected Distances in Polygons

Mikkel Abrahamsen, Viktor Fredslund-Hansen

We present an algorithm for computing the so-called Beer-index of a polygon $P$ in $O(n^2)$ time, where $n$ is the number of corners. The polygon $P$ may have holes. The Beer-index…