Abstract
The tiling of the plane by unit squares is only one of the 11 Archimedean tilings which use regular polygons and have only one type of vertex. In this paper, the boundary characteristic of a lattice polygon is defined for every Archimedean tiling, and related enumeration formulae are found. Pick's theorem (on the area of a lattice polygon in the tilling by squares) is then generalized for lattice polygons in each of the Archimedean tilings, by enumerating the number of tiles of each type in the polygon.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
