Premium
Finite edge‐to‐edge tilings by convex polygons
Author(s) -
Blind Roswitha,
Shephard G. C.
Publication year - 2001
Publication title -
mathematika
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.955
H-Index - 29
eISSN - 2041-7942
pISSN - 0025-5793
DOI - 10.1112/s0025579300014340
Subject(s) - mathematics , regular polygon , combinatorics , enhanced data rates for gsm evolution , type (biology) , convex curve , convex body , geometry , convex hull , telecommunications , ecology , computer science , biology
A tiling of a convex m ‐gon by a finite number r of convex n ‐gons is said to be of type < m, n, r >. The Main Theorem of this paper gives necessary and sufficient conditions on m, n and r for a tiling of type < m, n, r > to exist.