The De Casteljau Algorithm on Lie Groups and Spheres

  • Authors:
  • P. Crouch;G. Kun;F. Silva Leite

  • Affiliations:
  • Center for Systems Science and Engineering, Arizona State University, Tempe, AZ 85287–USA. peter.crouch@asu.edu;Lehrstuhl C für Mathematik, RWTH Aachen, D–52056 Aachen, Germany. kun@math2.rwth-aachen.de;Departamento de Matemática, Universidade de Coimbra, 3000 Coimbra–Portugal. fleite@mat.uc.pt

  • Venue:
  • Journal of Dynamical and Control Systems
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

We examine the De Casteljau algorithm in the context of Riemannian symmetric spaces. This algorithm, whose classical form is used to generate interpolating polynomials in {\Bbb R}^n, was also generalized to arbitrary Riemannian manifolds by others. However, the implementation of the generalized algorithm is difficult since detailed structure, such as boundary value expressions, has not been available. Lie groups are the most simple symmetric spaces, and for these spaces we develop expressions for the first and second order derivatives of curves of arbitrary order obtained from the algorithm. As an application of this theory we consider the problem of implementing the generalized De Casteljau algorithm on an m-dimensional sphere. We are able to fully develop the algorithm for cubic splines with Hermite boundary conditions and more general boundary conditions for arbitrary m.