凸F-多边形内部的F-点数  

On the Number of F-Points Inside a Convex F-Polygon

作　　者：郭自欢 魏祥林 GUO Zi-huan;WEI Xiang-lin(Shijiazhuang No.1 Middle School,Shijiazhuang 050000,China;College of Science,Hebei University of Science and Technology,Shijiazhuang 050018,China)

机构地区：[1]Shijiazhuang No.1 Middle School,Shijiazhuang 050000,China [2]College of Science,Hebei University of Science and Technology,Shijiazhuang 050018,China

出　　处：《Chinese Quarterly Journal of Mathematics》2024年第1期46-58,共13页数学季刊（英文版）

基　　金：Supported by National Natural Science Foundation of China(Grant No.12271139)。

摘　　要：An F-polygon is a simple polygon whose vertices are F-points, which are points of the set of vertices of a tiling of R~2 by regular triangles and regular hexagons of unit edge. Let f(v) denote the least possible number of F-points in the interior of a convex F-polygon K with v vertices. In this paper we prove that f(10) = 10, f(11) = 12,f(12) = 12.

关 键 词：Discrete geometry F-polygon Interior hull Lattice polygon 

分 类 号：O157.3[理学—数学]