A Novel Algorithm for Optimizing the Covering of a Bounded Planar Domain with Simple Geometric Figures
نویسندگان
1 Azerbaijan Technical University, Baku, Azerbaijan
2 Department of Applied Mathematics, Sahand University of Technology, Sahand New-Town, Tabriz, Iran
3 Military Scientific-Research Institute, National Defense University of the Ministry of Defense, Baku, Azerbaijan
4 Institute of Applied Mathematics, Baku State University, Baku, Azerbaijan
5 Institute of Information Technologies, Ministry of Science and Education of the Republic of Azerbaijan, Baku, Azerbijan
doi
10.30473/coam.2026.73282.1280چکیده
In this paper, we address the problem of covering a given bounded domain in the plane using simple geometric figures. The proposed approach is based on a discretization of the domain, which leads to a corresponding discrete optimization problem. To solve this problem, we introduce a novel iterative algorithm that minimizes a given objective function by generating successive neighboring nodal points. As the covering elements, circular sectors with centers located outside the domain are considered. The objective is to determine the locations of the sector centers and their radii in such a way that the entire domain is completely covered, while the ratio of the total area of the covering sectors to the area of the domain is minimized. Finally, the algorithm is demonstrated on a representative example, and the resulting coverings are illustrated.
