Hey! Sorry for what may be a stupid q but I am a complete newbie…
I am trying to implement a minimum distance check in a thing I am doing. Basically I have a spread of 2d vectors and I want ensure they stay a certain distance apart while in movement. I was just wondering how you can access the N+1 position in a spread?
I want to do a euclidean distance so I need (Xn,Yn) and (Xn+1,Yn+1). So how do you do this for all the spreads?
Any help would be much appreciated!
edit I just found differential! :)
[edit 2](edit 2) Ok I found differential but using this gives distances 1->2, 2->3, etc.
will have to modify it to scan through each spread maybe… Any ideas??