Theorems on tessellations by polygons
Journal Article
·
· Sbornik. Mathematics
- International Institute of Earthquake Prediction Theory and Mathematical Geophysics, Russian Academy of Sciences, Moscow (Russian Federation)
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}.
- OSTI ID:
- 21208318
- Journal Information:
- Sbornik. Mathematics, Journal Name: Sbornik. Mathematics Journal Issue: 6 Vol. 194; ISSN 1064-5616
- Country of Publication:
- United States
- Language:
- English
Similar Records
Probing convex polygons with X-rays
Parallel algorithms for separation of two sets of points and recognition of digital convex polygons
Does a point lie inside a polygon
Journal Article
·
Sat Oct 01 00:00:00 EDT 1988
· SIAM J. Comput.; (United States)
·
OSTI ID:6544239
Parallel algorithms for separation of two sets of points and recognition of digital convex polygons
Journal Article
·
Tue Mar 31 23:00:00 EST 1992
· International Journal of Parallel Programming; (United States)
·
OSTI ID:7279706
Does a point lie inside a polygon
Conference
·
Thu Dec 31 23:00:00 EST 1987
· Transactions of the American Nuclear Society; (USA)
·
OSTI ID:5433103