Papers published in the English version of the journal

The Minimum Number of Interior $H$-Points of Convex $H$- Dodecagons

X. Wei, W. Wang, Z. Guo

College of Science, Hebei University of Science and Technology, Shijiazhuang, 050018 China

Abstract: An $H$-polygon is a simple polygon whose vertices are $H$-points, which are points of the set of vertices of a tiling of $\mathbb{R}^{2}$ by regular hexagons of unit edge. Let $G(v)$ denote the least possible number of $H$-points in the interior of a convex $H$-polygon $K$ with $v$ vertices. In this paper we prove that $G(12)=12$.

Keywords: discrete geometry, lattice polygon, $H$-polygon, interior hull, outer hull.

Received: 12.09.2018
Revised: 12.01.2019

Language: English

 English version: Mathematical Notes, 2020, 107:3, 509–517

Bibliographic databases:

• 
• 
•