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

郭自欢, 魏祥林

doi:10.13371/j.cnki.chin.q.j.m.2024.01.004

数学季刊 >

2024 , Vol. 39 >Issue 1: 46 - 58

DOI: https://doi.org/10.13371/j.cnki.chin.q.j.m.2024.01.004

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

展开

1. Shijiazhuang No.1 Middle School, Shijiazhuang 050000, China; 2. College of Science, Hebei University of Science and Technology, Shijiazhuang 050018, China

GUO Zi-huan (1992-), female, native of Shijiazhuang, Hebei, master, lecturer of Shijiazhuang No.1 Middle School, engages in combinatorial geometry and discrete geometry; WEI Xiang-lin (1974-), female, native of Zhangjiakou, Hebei, doctor, professor of Hebei University of Science and Technology, engages in combinatorial geometry and discrete geometry.

收稿日期: 2022-08-25

网络出版日期: 2024-03-13

基金资助

Supported by National Natural Science Foundation of China (Grant No. 12271139).

收起

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

Expand

1. Shijiazhuang No.1 Middle School, Shijiazhuang 050000, China; 2. College of Science, Hebei University of Science and Technology, Shijiazhuang 050018, China

Received date: 2022-08-25

Online published: 2024-03-13

Supported by

Supported by National Natural Science Foundation of China (Grant No. 12271139).

Fold

摘要

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² 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

本文引用格式

郭自欢, 魏祥林 . 凸F-多边形内部的F-点数[J]. 数学季刊, 2024 , 39(1) : 46 -58 . DOI: 10.13371/j.cnki.chin.q.j.m.2024.01.004

Abstract

Key words： Discrete geometry; F-polygon; Interior hull; Lattice polygon

Options

文章导航

模态框（Modal）标题

摘要

本文引用格式

Abstract