|
This article is cited in 1 scientific paper (total in 1 paper)
Theorems on tessellations by polygons
M. L. Gerver International Institute of Earthquake Prediction Theory and Mathematical Geophysics RAS
Abstract:
What general regularity manifests itself in the fact
that a triangle, and in general any convex polygon, cannot be tessellated by
non-convex quadrangles? Another question: it is known that for $n>6$
the plane cannot be tessellated by convex $n$-gons
if their diameters are bounded, while the areas are
separated from zero; can this fact be generalized for non-convex
polygons? In the present paper we introduce the characteristic $\chi(M)$
of a polygon $M$. We answer the above questions in terms of $\chi(M)$
and then study tessellations of the plane by $n$-gons equivalent to $M$,
that is, with the same sequence of angles greater than and smaller than $\pi$.
Received: 16.08.2000 and 20.03.2003
Citation:
M. L. Gerver, “Theorems on tessellations by polygons”, Mat. Sb., 194:6 (2003), 87–104; Sb. Math., 194:6 (2003), 879–895
Linking options:
https://www.mathnet.ru/eng/sm743https://doi.org/10.1070/SM2003v194n06ABEH000743 https://www.mathnet.ru/eng/sm/v194/i6/p87
|
Statistics & downloads: |
Abstract page: | 521 | Russian version PDF: | 794 | English version PDF: | 20 | References: | 37 | First page: | 1 |
|