A322107 -id:A322107 - cp's OEIS frontend

A070911 a(n) is twice the least possible area enclosed by a convex lattice n-gon.

1, 2, 5, 6, 13, 14, 21, 28, 43, 48, 65, 80, 103, 118, 151, 174, 213, 242, 289, 328, 387, 420, 497, 548, 625, 690, 783, 860, 967, 1046, 1177, 1264, 1409, 1498, 1671, 1780, 1955, 2078, 2279, 2444, 2651, 2824, 3051, 3240, 3493, 3676, 3969, 4176, 4489, 4714, 5045, 5302, 5623, 5906

Offset: 3

Pierre Bornsztein (pbornszt(AT)club-internet.fr), May 20 2002

A convex lattice n-gon is a polygon whose n vertices are points on the integer lattice Z^2 and whose interior angles are strictly less than Pi.
For the even-indexed values, see A089187. The precisely known odd values were a(3)=1 (trivial), a(5)=5 and a(7)=13 (Arkinstall), a(9)=21 (Rabinowitz), a(11)=43 (Olszewska), a(13)=65 (Simpson), and a(15)=103 (Castryck). Additional values up to a(25) were first obtained as upper bounds "by massive calculations with several independent search programs" by Hugo Pfoertner. Pfoertner has made nice pictures of the best polygons he has found. See his link below. - Jamie Simpson, Dec 08 2022, adapted by Günter Rote, Sep 18 2023
From Günter Rote, Sep 18 2023: (Start)
The values a(n) can be computed in time polynomial in n by an algorithm of Eppstein, Overmars, Rote, and Woeginger from 1992: They showed how to compute the smallest convex n-gon in a set of N points in O(nN^3) time. The N points can be taken as an O(n^2) X O(n^2) grid: Each dimension of the bounding rectangle must be at least n/2, because a horizontal or vertical line can contain at most two vertices; since the area is known to be bounded by n^3, the other dimension cannot exceed 4n^2. In our case, the runtime can be reduced to O(nN^2), since the lowest vertex can be assumed to be a fixed point, say, the origin. By considering the lattice width, the grid can be reduced to size N=O(n^2) X O(n^1.5). Overall, this yields a theoretical runtime bound of O(n^8), for reporting all k-gons up to size n. This estimate agrees roughly with the observed runtimes in practice.
I have implemented the algorithm in Python and uploaded the program to the Code Golf Stackexchange site. It runs up to a(40) in a couple of minutes and produces some smallest polygon for each n. The values up to a(102) have been computed on a workstation in 31 hours. (End)

Andrey Zabolotskiy, Table of n, a(n) for n = 3..150 (terms 3..102 from _Günter Rote_)
Imre Bárány and Norihide Tokushige, The minimum area of convex lattice n-gons, Combinatorica, 24 (No. 2, 2004), 171-185.
Tian-Xin Cai, On the minimum area of convex lattice polygons, Taiwanese Journal of Mathematics, Vol 1, No 4 (1997).
W. Castryck, Moving Out the Edges of a Lattice Polygon, Discrete Comput. Geom., 47 (2012), pp. 496-518.
Code Golf StackExchange, The smallest area of a convex grid polygon, fastest-code challenge, started by Peter Kagey, Oct 22 2022.
David Eppstein, Mark Overmars, Günter Rote, and Gerhard Woeginger, Finding minimum area k-gons, Discr. Comput. Geom. 7 (1992), 45-58.
Steven R. Finch, Convex Lattice Polygons, December 18, 2003. [Cached copy, with permission of the author]
D. Olszewska, On the first unknown value of the function g(v), Electronic Notes in Discrete Mathematics, 24(2006), 181-185.
Hugo Pfoertner, Illustrations of optimal polygons for n <= 26, (2018).
S. Rabinowitz, O(n^3) bounds for the area of a convex lattice n-gon, Geombinatorics, vol.II, 4(1993), pp. 85-88.
Günter Rote, Python program for producing all optimal polygons
Günter Rote, Table of a(n), together with coordinates of smallest n-gons, for n=3..100, (2023). For some values of n, there are several polygons: From each equivalence class of smallest n-gons under affine lattice-preserving transformations, one representative is listed.
R. J. Simpson, Convex lattice polygons of minimum area, Bulletin of the Australian Math. Society, 42 (1990), pp. 353-367.

See A089187 for the even-indexed subsequence. See A063984 for further information.

Cf. A321693, A322029, A322106, A322107, A357888.

a(n)/2 = A063984(n) + n/2 - 1. [Simpson]

See Bárány and Tokushige for asymptotics.

Additional comments from Steven Finch, Dec 06 2003
a(11)-a(20) from Hugo Pfoertner, Nov 26 2018
a(21)-a(25) from Hugo Pfoertner, Dec 02 2018
a(13), a(26) and virtually all terms with even n up to a(42) (as given in A089187) go back to Jamie Simpson, Dec 07 2003
Data section cut at n=16 by N. J. A. Sloane, Dec 21 2022
a(17)-a(26) restored and a(27) onwards added by Günter Rote, Sep 18 2023

A322106 Numerator of the least possible squared diameter of an enclosing circle of a strictly convex lattice n-gon.

Original entry on oeis.org

2, 2, 50, 8, 10, 10, 1250, 29, 40, 40, 2738, 72, 82, 82, 176900, 17810, 1709690, 178, 11300, 260, 290, 290, 568690, 416, 2418050, 488, 3479450, 629, 2674061, 730

Offset: 3

Hugo Pfoertner, Nov 26 2018

If the smallest possible enclosing circle is essentially determined by 3 vertices of the polygon, the squared diameter may be rational and thus A322107(n) > 1.
The first difference of the sequences A321693(n) / A322029(n) from a(n) / A322107(n) occurs for n = 12.
The ratio (A321693(n)/A322029(n)) / (a(n)/A322107(n)) will grow for larger n due to the tendency of the minimum area polygons to approach elliptical shapes with increasing aspect ratio, whereas the polygons leading to small enclosing circles will approach circular shape.
For n>=19, polygons with different areas may fit into the enclosing circle of minimal diameter. See examples in pdf at Pfoertner link.

			By n-gon a convex lattice n-gon is meant, area is understood omitting the factor 1/2. The following picture shows a comparison between the minimum area polygon and the polygon fitting in the smallest possible enclosing circle for n=12:
.
    0 ----- 1 ----- 2 ------ 3 ------ 4 ------ 5 ------ 6
  6                          H ##### Gxh +++++ g
  |                     #        +      #    *   +
  |                 #       +              #        +
  |             #       +                 *   #        +
  5         I       i                          F        f
  |       #       +                    *        #       +
  |     #       +                                #      +
  |   #       +                     *             #     +
  4 J       j                                      #    e
  | #     @+                     *                  #  +
  | #     +      @                                   #+
  | #    +              @     *                      +#
  3 K   +                     @                     +   E
  |  # +                   *         @             +    #
  |   #                                    @      +     #
  |  + #                *                        +@     #
  2 k   #                                      d        D
  | +    #           *                       +        #
  | +     #                                +        #
  | +      #       *                    +         #
  1 l       L                         c        C
  |   +       # *                +        #
  |     +       #           +        #
  |       +  *    #     +        #
  0         a ++++ Axb ##### B
    0 ----- 1 ----- 2 ------ 3 ------ 4 ------ 5 ------ 6
.
The 12-gon ABCDEFGHIJKLA with area 52 fits into a circle of squared diameter 40, e.g. determined by the distance D - J, indicated by @@@. No convex 12-gon with a smaller enclosing circle exists. Therefore a(n) = 40 and A322107(12) = 1.
For comparison, the 12-gon abcdefghijkla with minimal area A070911(12) = 48 requires a larger enclosing circle with squared diameter A321693(12)/A322029(12) = 52/1, e.g. determined by the distance a - g, indicated by ***.

See A063984.

Hugo Pfoertner, Illustration of convex n-gons fitting into smallest circle, (2018).
Hugo Pfoertner, Illustration of convex n-gons fitting into smallest circle, n = 27..32, (2018).

Cf. A063984, A070911, A321693, A322029, A322107 (corresponding denominators).

a(27)-a(32) from Hugo Pfoertner, Dec 19 2018

A386538 a(n) is the maximum possible area of a polygon within a circle of radius n, where both the center and the vertices lie on points of a unit square grid.

Original entry on oeis.org

0, 2, 8, 24, 42, 74, 104, 138, 186, 240, 304, 362, 424, 512, 594, 690, 776, 880, 986, 1104, 1232, 1346, 1490, 1624, 1762, 1930, 2088, 2256, 2418, 2594, 2784, 2962, 3170, 3368, 3584, 3810, 4008, 4248, 4466, 4730, 4976, 5210, 5474, 5736, 6024, 6306, 6570, 6864, 7154

Offset: 0

Felix Huber, Aug 05 2025

nonn

a(n) > 99% of the circle area for n >= 50.
Conjecture: The maximum possible area of a polygon within the circle would be the same if only the vertices but not the center were fixed on grid points.
All terms are even.

			See linked illustration of the term a(4) = 42.

Felix Huber, Table of n, a(n) for n = 0..10000
Felix Huber, Illustration of a(4) = 42
Eric Weisstein's World of Mathematics, Pick's Theorem

Cf. A000217, A066643, A123690, A125228, A288247, A322106, A322107, A357577, A386539.

A386538:=proc(n)
    local x,y,p,s;
    p:=4*n;
    s:={};
    for x to n do
        y:=floor(sqrt(n^2-x^2));
        p:=p+4*y;
        s:=s union {y}
    od;
    return p-2*nops(s)
end proc;
seq(A386538(n),n=0..48);

a[n_] := Module[{p=4n},s = {}; Do[ y = Floor[Sqrt[n^2 - x^2]];p = p + 4*y;s = Union[s, {y}],{x,n} ];p - 2*Length[s]];Array[a,49,0] (* James C. McMahon, Aug 19 2025 *)

a(n) = A386539(A000217(n)) = A386539(n,n) for n >= 1.

a(n) <= A066643(n).

cp's OEIS Frontend

A070911 a(n) is twice the least possible area enclosed by a convex lattice n-gon.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

Extensions

A322106 Numerator of the least possible squared diameter of an enclosing circle of a strictly convex lattice n-gon.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Extensions

A386538 a(n) is the maximum possible area of a polygon within a circle of radius n, where both the center and the vertices lie on points of a unit square grid.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula