This repository contains a number of algorithms for solving the problem of finding a convex polygon with bounded area, containing as many points as possible, also known as the Bounded Area Maximum ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback