Abstract
A convex lattice polygon is a polygon whose vertices are points on the integer lattice and whose interior angles are strictly less than π radians. We define a(2n) to be the least possible area of a convex lattice polygon with 2n vertices. A method for constructing convex lattice polygons with area a(2n) is described, and values of a(2n) for low n are obtained.
Publisher
Cambridge University Press (CUP)
Reference5 articles.
1. [4] Rabinowitz Stanley , Convex Lattice Polygone, Ph.D. Dissertation (Polytechnic University, Brooklyn, New York, 1986).
2. Minimal requirements for Minkowski's theorem in the plane I
3. On the number of lattice points inside a convex lattice n-gon;Rabinowitz;Congr. Numer.,1990
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献