Boost.Geometry GSoC 2019 Competency Test

The following source code implements an s-hull based method for triangulation and a method for uniformly sampling points inside a convex polygon. The input for the triangulation is generated using a normal distribution.

shull.hpp

convex-polygon-sampler.hpp

main.cpp

Output

Time for Delaunay-Triangulation of 100000 random points: 515ms
All points inside polygon? yes
3103/5000 (0.6206) points in lower half. Area ratio: 0.627613
	

Output file: triangulation.svg

Output file: random_samples.svg