This program accompanies the paper "Counting large distances in convex polygons" by Filip Moric and David Pritchard. The program, written in Java, searches a finite set of distance configurations in order to deduce theorems about convex polygons.
Categories
MathematicsLicense
GNU General Public License version 3.0 (GPLv3)Follow Counting large distances in convex sets
Other Useful Business Software
Orchestrate Your AI Agents with Zenflow
Zenflow orchestrates AI agents like a real engineering system. With parallel execution, spec-driven workflows, and deep multi-repo understanding, agents plan, implement, test, and verify end-to-end. Upgrade to AI workflows that work the way your team does.