We present an algorithm to generate a smooth curve interpolating a set of data on an $n$-dimensional ellipsoid, which is given in closed form. This is inspired by an algorithm based on a rolling and wrapping technique, described in \cite{fatima-knut-rolling} for data on a general manifold embedded in Euclidean space. Since the ellipsoid can be embedded in an Euclidean space, this algorithm can be implemented, at least theoretically. However, one of the basic steps of that algorithm consists in rolling the ellipsoid, over its affine tangent space at a point, along a curve. This would allow to project data from the ellipsoid to a space where interpolation problems can be easily solved. However, even if one chooses to roll along a geodesic, the fact that explicit forms for Euclidean geodesics on the ellipsoid are not known, would be a major obstacle to implement the rolling part of the algorithm. To overcome this problem and achieve our goal, we embed the ellipsoid and its affine tangent space in $\R^{n+1}$ equipped with an appropriate Riemannian metric, so that geodesics are given in explicit form and, consequently, the kinematics of the rolling motion are easy to solve. By doing so, we can rewrite the algorithm to generate a smooth interpolating curve on the ellipsoid which is given in closed form.
interpolation, rolling, group of isometries, ellipsoid, kinematic equations
65D05, 65D07, 65D10, 53B21, 53C22, 70B10