Abstract
Let \(L\)[3.6.3.6] be the set of vertices generated by the edge-to-edge Archimedean planar tiling using regular triangles and regular hexagons of unit-length, a point \(x\in L\)[3.6.3.6] be an \(L-\)point. Suppose the corners of a planar polygon \(P\) are \(L-\)points of \(L[3.6.3.6]\), then the area of \(P\) is \(A(P)=\frac{\sqrt{3}}{3}[b(P)+2i(P)+\frac{c(P)}{8}\) \(-3]-\frac{\sqrt{3}}{12}sc(P)\), where \(b(P)\) is the number of \(L-\)points on the boundary of \(P, i(P)\) is the number of \(L-\)points in the interior of \(P, c(P)\) is the boundary characteristic of \(P\), and \(sc(P)\) is the side characteristic of \(P\).
Similar content being viewed by others
References
Ding, R., Reay, J.R.: The boundary characeristic and Pick’s theorem in the Archimedean planar tilings. J. Comb. Theory Ser. A 44, 110–119 (1987)
Ding, R., Kołodziejczyk, K., Reay, J.R.: A new Pick-type theorem on the hexagonal lattice. Discret. Math. 68, 171–177 (1988)
Ding, R., Reay, J.R., Zhang, J.: Areas of generalized H - polygons. J. Comb. Theory Ser. A 2, 304–317 (1997)
Wei, X., Ding, R.: \(H-\)triangles with \(k\) interior \(H-\)points. Discret. Math. 308, 6015–6021 (2008)
Kołodziejczyk, K., Olszewska, D.: A proof of Coleman’s conjecture. Discret. Math. 307, 1865–1872 (2007)
Kołodziejczyk, K.: Realizable quadruples for Hex-polygons. Graphs Combinatorics 23, 61–72 (2007)
Acknowledgments
This research was supported by National Natural Science Foundation of China, Natural Science Foundation of Hebei Province (A2014208095).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wei, X., Wang, J. & Gao, F. A note on area of lattice polygons in an Archimedean tiling. J. Appl. Math. Comput. 48, 573–584 (2015). https://doi.org/10.1007/s12190-014-0819-9
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12190-014-0819-9