(I am applying the things in a software, so I used some programming code, but they are easy to understand I think )
If I have a vector:
var origin = new Vector(x, y)
then, I would like to get N sub vectors, each one of the N sub vector is got by adding origin
vector with a new vector, like:
subVector = origin.add(new Vector(m, n));
The result I would like to achieve is showing in the image below:
I would like to define a algorithm to get N sub vectors which are in the same horizontal level (that's the same Y value) and spaced by "L" length, just like the above image shows.
My questions are:
1. what is the new vector (Vector(m, n)
) m, n values I should use to get all the sub vectors ? (N is dynamic value)
I end up with something like: for(var i=0; i
2. How to choose the new vector (Vector(m, n)
) m, n value to make sure the distance between two neighboring sub vectors is L as showed in the image ?