Classifying Rational Polygons with Small Denominator and Few Interior Lattice Points
Discrete & Computational Geometry · 2026-09 · 76 (2) · 1238-1265
DOI: 10.1007/s00454-026-00822-0 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete & Computational Geometry, online erschienen am 07.03.2026. Verfasst von Martin Bohnert und 1 weiteren Autor:innen. Die Arbeit nennt 39 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
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.
Zitieren
APA
Bohnert, M., & Springer, J. (2026). Classifying Rational Polygons with Small Denominator and Few Interior Lattice Points. Discrete & Computational Geometry, 76(2), 1238-1265. https://doi.org/10.1007/s00454-026-00822-0
Vancouver
Bohnert M, Springer J. Classifying Rational Polygons with Small Denominator and Few Interior Lattice Points. Discrete & Computational Geometry. 2026;76(2):1238-1265. doi:10.1007/s00454-026-00822-0
BibTeX
@article{Bohnert2026,
author = {Bohnert, Martin and Springer, Justus},
title = {Classifying Rational Polygons with Small Denominator and Few Interior Lattice Points},
journal = {Discrete & Computational Geometry},
year = {2026},
volume = {76},
number = {2},
pages = {1238--1265},
doi = {10.1007/s00454-026-00822-0}
}
EUVIMED