3 papers
cs.CG2026
Computing All Lattice-Rectangle Counts by Rational Staircase Sums
Dmitry Babichev, Denis Pinchuk
Let be the number of rectangles, not necessarily axis-parallel, whose vertices belong to the square grid of lattice points. We compute the complete table $F(1),\…
cs.CG2026
Counting Lattice Rectangles in Operations
Dmitry Babichev, Tatiana Shpakova
Let be the number of rectangles, not necessarily axis-parallel, whose vertices belong to the square grid of lattice points. We give an exact algorithm that compu…
cs.CG2026
Counting All Lattice Rectangles in the Square Grid in Near-Linear Time
Dmitry Babichev, Sergey Babichev
We study the exact counting problem for all lattice rectangles contained in the square , including non-axis-parallel ones. Starting from the standard parametrizat…