There are many very useful computational techniques for calculating the arc length of parametric curves. See for instance this paper and references therein. What I could not find easily was a similar study for non-parametric ones. Specifically, cubic algebraic curves.
My question is: can I do better than the chord length algorithm where I estimate the arc length by summing the individual line segments connecting a sample of points on the curve?
I strongly believe there must be a better (faster converging) method, especially since for every sampled point on the curve, I can easily compute the normal vector and (not so easily) other geometrical information, such as curvature, etc.
Edit: The curves I'm working with have a single component in the region of interest, which is a well defined simplex. Also, for these curves I have managed to develop an adaptive sampling technique which I use to find any number of points up to any precision.