Rep-tiling for triangles
โ Scribed by Stephen L. Snover; Charles Waiveris; John K. Williams
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 409 KB
- Volume
- 91
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper we prove that one can only tile a triangle with tiles all congruent to each other and similar to the original triangle when k ', I* + k*, or 3k* tiles are used. The result is based on the geometry of packing and a result of I. Niven's on rational trigonometric values. In addition we describe how to tile most triangles.
1. Constructions
Construction of a k2-tiling. Take any triangle and divide each of its sides into k pieces of equal length. Then draw the line segments joining the corresponding points as in Fig. 1.
๐ SIMILAR VOLUMES
The random triangle-square tiling with twelvefold quasicrystalline order is studied by using the transfer-matrix method. Based on a systematic finite-size analysis for L ร oo lattices up to L = 9, the maximum entropy per vertex for an infinite system is estimated to be S= 0.119 \_+ 0.00 I. The ratio