Средства математического моделирования задач покрытия

Abstract

The article considers theorems which are useful for the mathematical and computer modeling of the covering problems of a compact canonical multiconnected polygonal set with a finite family of convex polygons. Based on peculiarities of a rectangular cover, theorems concerning a partition of the translation vector space and an upper bound of the number of local extrema of the Г-function are formulated.