Dense coverage of the computational domain by hexagonal tiles
P. I. Sobolevsky, S. V. Bakhanovich · Doklady of the National Academy of Sciences of Belarus · 2018
The hexagonal tiling in application to algorithms with a two-dimensional computational domain is investigated. A formal definition of a parametrized hexagonal tiling is proposed. Necessary and sufficient conditions for a dense coverage of the computational domain by hexagonal tiles are obtained. Communicated by Corresponding Member Leonid A. Yanovich