Hi,
I am a bit stuck 
; but I think it should be easy…
Points on a curve should be placed in a way so the distance between them is equal. The first point should be at the start of the curve and the last one at the end.
Divide Curve will not work since the curve is not straight.
kangaroo will work but it seems a bit overkill / also many, many curves
thanks for any help!
I think you won’t get away from needing some iterative approach to this.
Here’s a simple cluster that will work for multiple curves at once.
nice! really appreciated 
thank you, but it seems that the last point is not at the endpoint of the curve.
or am i missing something?
if anybody wants to divide each curve into different spaced points: graft the “int” input
Have a look also in this thread (different solutions). The linked post has a component which refines the iteration algorithm until the end point is reached (IIRC).
// Rolf
check this , the last post : EqualizeSegmentsDivide.ghuser,
thanks, its actually a bit faster than the kangaroo version!
interesting, is there a difference between this and divide curve? it seems that it has the same characteristic, in that the segments get smaller in areas of high curvature. e.g. segment 6 is the shortest and sits right in the corner of the first bend.
I was wondering if it would be possible with kangaroo to segement the curve so that not only the the distance between points (speed) is under a certain limit but also the acceleration and jolt.
To do this I would normally just use a while loop and decrease the segment lenght until the conditions are met.
Is there a smarter way?
thanks!
I’m not sure I follow - do you mean to keep the rate of change of consecutive segment lengths of the polyline under some limit? Or are you talking about the angles?
I mean the curve derivative. I am a little out of my depht, so pease be forbearing with me.
When a curve is divided into segments the change of position between consecutive points can be understood as the speed of the curve.
If each equidistant point is reached with a timestep of e.g.: 1 second this will ensure a constant speed (the speed value is depended on the lenght of the segment and timestep).
But acceleration between points also depends on the angle between them.
What I am looking for is a sementation that ensures that all 3 criteria (speed, acceleration, jolt) are under a certain limit
maybe the description was a little unclear. I will try again. ( non native speaker , complicated subject)
Let’s image a car moving along nurbs curve road. The car can move at different speeds but is very susceptible to forces acting on the car.
Since years of experience with his bad car the driver knows just how to drive it right at the limit of breakage.
I wonder, overlooking the nurbs-curve road, where will the car be at time T?
my naive approach would be: when in doubt - drive slower. So:
calc next point: while(speed,acc,jolt > limit) decrease timestep
this would be an approximate solution and based on some kind of while loop
here is my first attempt to solve this problem:
at the moment the script only cares about Δx/Δt so speed, but I hope I can code something so it takes acceleration and jolt into account.
I forgot that the car does a standing start and stop – so this will be quite challenging aswell
@ mcneel/mods : since this is a quite different question than the thread started – can or should it be split into seperate thread at post #17 ?
