An H-polygon is a polygon with corners in the set of vertices of a tiling of R~2 by regular hexagons of unit edge.It is known that any H-triangle with exactly k interior H-points can have at most 3k+7 boundary H-point...An H-polygon is a polygon with corners in the set of vertices of a tiling of R~2 by regular hexagons of unit edge.It is known that any H-triangle with exactly k interior H-points can have at most 3k+7 boundary H-points.In this note we prove that any convex H-quadrilateral with exactly k interior H-points can have at most 3k+7 boundary H-points.展开更多
文摘An H-polygon is a polygon with corners in the set of vertices of a tiling of R~2 by regular hexagons of unit edge.It is known that any H-triangle with exactly k interior H-points can have at most 3k+7 boundary H-points.In this note we prove that any convex H-quadrilateral with exactly k interior H-points can have at most 3k+7 boundary H-points.
