Tiling Hexagons with Smaller Hexagons and Unit Triangles
暂无分享,去创建一个
This is a numerical study of the combinatorial problem of packing hexagons of some equal size into a larger hexagon. The problem is well defined if all hexagon edges have integer length and if their centers and vertices share the common lattice points of a triangular grid with unit distances.
[1] Andrea Grosso,et al. Solving the problem of packing equal and unequal circles in a circular container , 2010, J. Glob. Optim..
[2] Tao Ye,et al. Quasi-physical global optimization method for solving the equal circle packing problem , 2011, Science China Information Sciences.
[3] N. J. A. Sloane,et al. The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..