Home > Back-end >  C algorithm is to cover the hexagonal rectangular coordinates
C algorithm is to cover the hexagonal rectangular coordinates

Time:02-23

The width of a given rectangle, the length of hexagon, can cover the center of the rectangle by the number of hexagon with hexagon coordinate

CodePudding user response:

Imagine "hexagonal grid size and location is constant, the rectangle scaling, translation and rotation" scene,
Obviously, inadequate conditions, the solution is not the only,

CodePudding user response:

Obviously, for half of the long side of the rectangle side length of hexagonal only need three is enough to cover a rectangle

CodePudding user response:

reference 1/f, zhao teacher reply:
imagine "hexagon grid size and location is changeless, the rectangle scaling, translation and rotation" scene,
Obviously, condition is insufficient, is not the only solution,
for any other type of can

CodePudding user response:

refer to the second floor early play big play nuclear response:
apparently, for half of the long side of the rectangle side length of hexagonal only need three is enough to cover a rectangle
hexagonal side length is given
  • Related