Best fit points on line, outside of region, within specific dimensions

Hi all, Long time listener first time caller.
I am looking to divide a set of curves into equal lengths and then iteratively move all the points along the same vector of the line they were created on, maintaining distance between the division points and limiting the transformation to stay within the distance of the remainder (the distance between the end point of the line and the last point in the list of division points). I would then like to find which iteration results in the least amount of points within a a set of regions. Happy to use Galapagos or Kangaroo if needed. Any thoughts???

1 Like