A measure of non-convexity in the plane and the Minkowski sum (Q603859)

The angular convexity \(\text{aco}\,K\) of a simple polygon \(K\subset\mathbb{R}^2\) is defined as the least rotation among all subpolylines oriented along \(P\). The angular convexity is always non-positive, and is equal to zero for a convex polygon. It is obtained that if the angular convexities of two simple polygons, \(K\) and \(L\), are both greater than \(-\pi\), then \(\text{aco}\,K+L\geq\min\{\text{aco}\,K\text{aco}\,L\}\), where the plus sign denotes Minkowksi sum. A point outside a simple polygon \(K\), \(\text{aco}\,K>-\pi\), can be separated from it by an angular region. The latter result is a generalization of the separation theorem for complex sets.