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
Crowdtesting That Delivers | Testeum
Testeum connects your software, app, or website to a worldwide network of testers, delivering detailed feedback in under 48 hours. Ensure functionality and refine UX on real devices, all at a fraction of traditional costs. Trusted by startups and enterprises alike, our platform streamlines quality assurance with actionable insights.