Trying to find an convex hexagon without inner points in a random pointcloud.

We know that 29 points is not enough to have an empty hexagon (Mark Oversmars, Utrecht University) and that 463 *are* enough (demonstrated in 2007 by Vitaliy Koshelev, Moscow University). May we find a set of more than 29 non-aligned points without empty convex hexagon? Pour la Science #376 paper

N: equal points:
align points:

Checking manually i: j: k: l: m: n:
Searching for N points with no hexagon Will loop until finding a configuration of N points with no hexagon
Searching for quads/pentagons/hexagons amount in [N1...N2] points from N1= to N2=
Optimize Parsing ---
Shaking (radius=) ---
onlineDB :