Affiliation:
1. School of Mathematics, North University of China, Taiyuan 030051, China
Abstract
In Chuanming Zong’s program to attack Hadwiger’s covering conjecture, which is a longstanding open problem from Convex and Discrete Geometry, it is essential to estimate covering functionals of convex bodies effectively. Recently, He et al. and Yu et al. provided two deterministic global optimization algorithms having high computational complexity for this purpose. Since satisfactory estimations of covering functionals will be sufficient in Zong’s program, we propose a stochastic global optimization algorithm based on CUDA and provide an error estimation for the algorithm. The accuracy of our algorithm is tested by comparing numerical and exact values of covering functionals of convex bodies including the Euclidean unit disc, the three-dimensional Euclidean unit ball, the regular tetrahedron, and the regular octahedron. We also present estimations of covering functionals for the regular dodecahedron and the regular icosahedron.
Funder
National Natural Science Foundation of China
Fundamental Research Program of Shanxi Province
Reference29 articles.
1. Boltyanski, V., Martini, H., and Soltan, P.S. (1997). Excursions into Combinatorial Geometry, Universitext, Springer.
2. Combinatorial problems on the illumination of convex bodies;Martini;Aequationes Math.,1999
3. Bezdek, K. (2010). Classical Topics in Discrete Geometry, CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC, Springer.
4. Brass, P., Moser, M., and Pach, J. (2005). Research Problems in Discrete Geometry, Springer.
5. The geometry of homothetic covering and illumination;Bezdek;Discrete Geometry and Symmetry,2018