Smooth Interpolation of Rotational Motions
Abstract
The authors consider an object is undergoing rotational motions, with orientation known at given times, and wish to interpolate the orientation between those times. If the orientations are represented as unit quaternions, this is equivalent to interpolating among a sequence of points on the three-sphere in four-space. They present an algorithm for doing this smoothly. If the object possesses rotational symmetry, then its orientation is given by its axis, and can be represented as a point on the unit sphere in three-space. The problem of interpolating on the sphere is of interest in its own right, and has other applications. The authors have implemented an algorithm for this, and present graphical results.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cite
Text
Roberts et al. "Smooth Interpolation of Rotational Motions." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1988. doi:10.1109/CVPR.1988.196314Markdown
[Roberts et al. "Smooth Interpolation of Rotational Motions." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1988.](https://mlanthology.org/cvpr/1988/roberts1988cvpr-smooth/) doi:10.1109/CVPR.1988.196314BibTeX
@inproceedings{roberts1988cvpr-smooth,
title = {{Smooth Interpolation of Rotational Motions}},
author = {Roberts, Kenneth S. and Bishop, Gary and Ganapathy, S. Kicha},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {1988},
pages = {724-729},
doi = {10.1109/CVPR.1988.196314},
url = {https://mlanthology.org/cvpr/1988/roberts1988cvpr-smooth/}
}