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
Our Free Plans just got better! | Auth0
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.