Learn More
At the beginning of the series of papers we present systematic approach to exhaust the convex pentagonal tiles of edge-to-edge (EE) tilings. Our procedure is to solve the problem systematically step by step by restricting the candidates to some class. The first task is to classify both of convex pentagons and pentagonal tiling patterns. The classification(More)
We derived 14 types of tiling cases under a restricted condition in our previous report, which studied plane tilings with congruent convex pentagons. That condition is referred to as the category of the simplest set of node (vertex of edge-to-edge tiling) conditions when the tile is a convex pentagon with four equal-length edges. This paper shows the(More)
We introduce a plan toward a perfect list of convex pentagons that can tile the whole plane in edge-to-edge manner. Our strategy is based on Bagina's Proposition, and is direct and primitive: Generating all candidates of pentagonal tiles (several hundreds in number), classify them into the known 14 types, geometrically impossible cases, the cases that do(More)
  • 1