Geometry of Continued Fractions pp 19-31 | Cite as

# On Integer Geometry

- 2.2k Downloads

## Abstract

In many questions, the geometric approach gives an intuitive visualization that leads to a better understanding of a problem and sometimes even to its solution. This chapter is entirely dedicated to notions, definitions, and basic properties of integer geometry. We start with general definitions of integer geometry, and in particular, define integer lengths, distances, areas of triangles, and indexes of angles. Further we extend the notion of integer area to the case of arbitrary polygons whose vertices have integer coordinates. Then we formulate and prove the famous Pick’s formula that shows how to find areas of polytopes simply by counting points with integer coordinates contained in them. Finally we formulate one theorem in the spirit of Pick’s theorem: it is the so-called twelve-point theorem.

## Keywords

Integer Geometry Integer Area Integer Length Integer Coordinates Integer Triangles## References

- 59.W. Fulton,
*Introduction to Toric Varieties*. Annals of Mathematics Studies, vol. 131 (Princeton University Press, Princeton, 1993). The William H. Roever Lectures in Geometry zbMATHGoogle Scholar - 106.A.G. Khovanskiĭ, Newton polytopes, curves on toric surfaces, and inversion of Weil’s theorem. Russ. Math. Surv.
**52**(6), 1251–1279 (1997). Russian version: Usp. Mat. Nauk**52**(6), 113–142 (1997) CrossRefGoogle Scholar - 168.B. Poonen, F. Rodriguez-Villegas, Lattice polygons and the number 12. Am. Math. Mon.
**107**(3), 238–250 (2000) MathSciNetzbMATHCrossRefGoogle Scholar - 171.D. Repovsh, M. Skopenkov, M. Tsentsel, An elementary proof of the twelve lattice point theorem. Math. Notes - Ross. Akad.
**77**(1–2), 108–111 (2005). Russian version: Mat. Zametki**77**(1), 117–120 (2005) MathSciNetCrossRefGoogle Scholar