Covering a rectangle with six and seven circles
Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
Hi-index | 0.00 |
The paper considers the problem of covering compact polygonal set by identical circles of minimal radius. A mathematical model of the problem based on Voronoi polygons is constructed and its characteristics are investigated. On the ground of the characteristics a modification of the Zoutendijk feasible directions method is developed to search local minima. A special approach is suggested to choose starting points. Many computational examples are given.