首页|On the Number of F-Points Inside a Convex F-Polygon
On the Number of F-Points Inside a Convex F-Polygon
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
万方数据
An F-polygon is a simple polygon whose vertices are F-points,which are points of the set of vertices of a tiling of R2 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.
万方数据
