Hello!
I want to make an algorithm that adds the closest points in all directions into a table, but it needs to know what all the closest parts are.
How could i make it sort out the closest points in the field?
let me give you an example:
these are all the available parts.
[0] will be the origin part, where we would call this function from.
in this scenario, i want it to only return a table containing part 2 4 6 or 8.
and in this scenario, i want it to only return 2 and 4.
I’m not that good at math, so any help in getting started with this would be incredible!
if you need any more context, don’t hesitate to let me know. Thanks in advance!