The problem of partition of a poligonal domain with arbitrary holes into a minimal number of convex parts is solved. It is show that this minimal number equals m+c-h-e, where m, c, h and e are respectively the measure of ...
In this article, necessary and sufficient conditions are given in which a set of a metric space is represented as a union of a finite number of convex sets. JEL: C65 Miscellaneous Mathematical Tools