Subdivide by equal chord length

[cesarecaoduro]

Subdivide a curve in equally spaced segments using the chord length

[d3ssy]

@cesarecaoduro can you give an example of desired functionality? From the description it is the same as DivideByCount. since it produces equal spacing and therefore results in equal chord lengths between the points at the equally spaced params. Should it be DivideByMaxChordLength (akin to DivideByMaxSpacing)?

[sonomirco]

@d3ssy and @cesarecaoduro, what do we want to do with this issue?

[cesarecaoduro]

If the divide by count is calculated along the curve, it is not the same distance.
For the chord length, di distance between two consecutive points has to be the same. This is the secant of the obscurant circle defined by the 2 points.

[d3ssy]

In the current implementation we have ParameterAtChordLength (returns a param t' from a starting param t given a chord length l), and DivideByChordLength which returns parameters along the curve spaced at equal chord lengths with whatever length is left over at the end of the curve.

Are you asking for a method that takes a COUNT and divides the curve into count-1 segments such that the chord lengths of all segments are equal?

[cesarecaoduro]

Correct