Classifying rational polygons with small denominator and few interior lattice points

Abstract

We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a suitable normal form. Executing our classification, we obtained a dataset of several billions of polygons covering a wide variety of cases.