Implement a benchmark algorithm Delaunay3D

[Chubercik]

• Implements 🟪Algorithm🟪 Delaunay3D: Delaunay 1000 points in 3D benchmark of the Math category proposed in [Call to Action] Benchmarks for the benchmark server #36.
• Depends on Expose 3D Delaunay tetrahedralization in Geometry3D godot#83353.

[Chubercik]

If the PR mentioned above gets merged, completing this PR should be as easy as changing the insides of the benchmark_delaunay3D() function to:

Geometry3D.tetrahedralize_delaunay(scattered_points)

[Calinou]

Same concerns as #38 apply to this PR, although this one isn't in a functional until 3D Delaunay triangulation is expsed to scripting.

[Chubercik]

Committed an update that should be the final version. I haven't changed the number of points, because on my low-end laptop this benchmark takes ~4000ms when running on a dev build of godotengine/godot@bc78c83.

I assume on a rig with the CPU you mentioned this will take significantly less time.

[Geometror]

@Chubercik Can you change this PR's status from draft to ready for review?

[Chubercik]

The reason why I left it hanging as a draft is because until (probably) Godot 4.3 comes out, code from this PR won't be able to run - there is no such function as Geometry3D.tetrahedralize_delaunay() in 4.1, upcoming 4.2 or even master, yet.

[Geometror]

Oh sorry, I overlooked that. But I think it's fine either way. Could you add a Depends on <link to PR> to your PR description?

[Chubercik]

Sure thing, the PR description has been updated.

[Calinou]

Tested locally, it works as expected.

For reference, these are the scores on a debug editor build on an i9-13900K:

• Delaunay 2D: 71 ms
• Delaunay 3D: 482 ms

And on an optimized editor build:

• Delaunay 2D: 71 ms
• Delaunay 3D: 458 ms