# A New Algorithm for Discrete Area of Convex Polygons with Rational Vertices

* Corresponding author
Abstract : A new algorithm is presented, which computes the number of lattice points lying inside a convex plane polygon from the sequence of the rational coordinates of its vertices. It reduces the general case in a natural way to a fondamental one, namely a triangle with vertices of coordinates $\{(0;0),(n;0),(n;n\frac{a}{b})\}$, where $n$, $a$ and $b$ are positive natural integers. Then it evaluates the discrete area of such a triangle using the Klein polyhedron of slope $\frac{a}{b}$ and the Ostrowski representation of $n$ with the numeration scale of denominators of the convergents of the continued fraction expansion of $\frac{a}{b}$ .
Keywords :
Document type :
Preprints, Working Papers, ...

Cited literature [12 references]

https://hal.archives-ouvertes.fr/hal-00751492
Contributor : Henri-Alex Esbelin <>
Submitted on : Thursday, February 7, 2013 - 3:28:33 PM
Last modification on : Tuesday, February 19, 2019 - 12:30:02 PM
Long-term archiving on : Wednesday, May 8, 2013 - 3:56:03 AM

### File

HAL_counting_cor1.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : hal-00751492, version 2

### Citation

Henri-Alex Esbelin. A New Algorithm for Discrete Area of Convex Polygons with Rational Vertices. 2012. ⟨hal-00751492v2⟩

Record views