I was looking to find out if anyone knows of an optimal method to find the squared distance of a path defined by a series of 3D points?
Given an arbitrary array of vectors, find the squared sum of the distance between each points and its previous point I mean.
To my knowledge in order to do this you have to sum up all the distances and then square the result. But was wondering if there was a tricky way to do this only using the squared distance between each of the points.