Abstract: We show how two recent algorithms [6,7,14] for computing $C^1$ quartic interpolating splines can be stabilized to insure that for smooth functions, they provide full approximation power with approximation constants depending only on the smallest angle in the triangulation.

Preprint version available:    pdf