I’m wondering if it’s possible to simplify this move logic that I currently have by manipulating the datatree?

duplicating vectors to create redundant data doesn’t seem very smart.

While it works fine in my small test, i’m afraid it’s not scalable if there’s hundred or thousands of points and vectors

Basically the step/vector length (distance between points) are always the same, but the count would be different, this is determined thru some other calculation that’ll tell me how many time I need to move that point.

The result will always be a rectangle array of points