On 5/14/05, aaron@...749... <aaron@...749...> wrote:
aaron@...749... wrote:
bulia byak wrote:
Actually it's hard to say how well your interpolation works, because it only produces one intermediate path. Can you take the number of steps as a parameter, and create the specified number of equidistant steps? Then it will be easy to see how good is your algorithm based on how smooth and natural is the transition.
Absolutely, that was one variation I thought of. I will do this right away. Interpolation Time will only mater if the number of steps is set to 1.
Done.
Thanks, works excellent - though only for equal-nodes paths. To equalize the number of nodes, I would try this:
1 find which path has less nodes
2 on that path's memory copy, find which nodes are farthest apart, and divide the line or curve between them in two (see sp_nodepath_line_midpoint for the formula)
3 repeat 2 until the paths have the same number of nodes, then interpolate
The distance between nodes in 2 is ideally calculated as "distance along path", here's the formula: http://www.cit.gu.edu.au/~anthony/info/graphics/bezier.curves