I'm plotting points on a 3D plane so the coordinates are (X,Y,Z), but the height, Y, will be hardcoded so the algorithm doesn't have to include checking for that.
The way I currently plot the points is that on mount, a function is called to generate a random coordinates based on the sin and cos of a random angle. This results in duplicates and points really close together.
I was considering converting the array of positions to a set to remove duplicates, but that would not solve recursively checking each point to ensure a minimum distance.
Can someone help me brainstorm, or offer some guidance in designing this algorithm. Thanks in advance.