
doi: 10.1109/18.333894
The number of convex polygons whose all vertices belong to an integer grid of size \(m \times m\) is denoted by \(D(m)\). The authors prove that \(\log D(m)\) is of the order of magnitude \(m^{2/3}\) as \(m \to \infty\).
digital polygon, Lattices and convex bodies in \(2\) dimensions (aspects of discrete geometry), Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry), Lattices and convex bodies (number-theoretic aspects), Computational aspects related to convexity, convex polygons, grid
digital polygon, Lattices and convex bodies in \(2\) dimensions (aspects of discrete geometry), Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry), Lattices and convex bodies (number-theoretic aspects), Computational aspects related to convexity, convex polygons, grid
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 14 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
