top of page
Finding the closest points in a 3D space
Using the divide and conquer method I made a program in Godot using GDScript to figure out which 2 points in a 3D space are the closest. The two red dots indicate that they are the closest in that space.
In the program you can choose any number of points and the space size to have the program Instantiate that many points in that size. This makes the program have lots of variety to make sure the Divide and Conquer Algorithm is accurate.
This is how the Divide and Conquer Algorithm works
Project Link
bottom of page