Implement a benchmark algorithm Delaunay2D

[Chubercik]

• Implements 🟪Algorithm🟪 Delaunay2D: Delaunay 1000 points in 2D benchmark of the Math category proposed in [Call to Action] Benchmarks for the benchmark server #36.

[reduz]

Wow, great work!

[Calinou]

Tested locally, it works as expected.

However, this benchmark runs in roughly 2 ms on my i9-13900K with an optimized Linux editor binary. This means there's high potential for variance due to differences in setup time. We want to make sure we are benchmarking the actual triangulation logic, not the time it takes for the script to be parsed and compiled.

I suggest making it run more iterations so that running the benchmark requires 25× more time (it should take at least 50 ms on my CPU).

PS: delaunay2D.gd should be renamed to delaunay_2d.gd for consistency with other file names in the project.

[Chubercik]

Committed an update which changes the number of points used by the algorithm from 1000 to 7000, which on my setup ups the benchmark's execution time from ~5.5ms to ~250ms - if this time I overdid the time it takes to complete be sure to hit me up and I'll fiddle with it further.

[Calinou]

It now takes 75 ms to run on my setup with a release build, which should be good enough for accurate measurements.