The De Casteljau algorithm on Lie groups and spheres
Geodesics in global differential geometry (53C22) Differential geometry of symmetric spaces (53C35) Computer-aided design (modeling of curves and surfaces) (65D17) Computational methods for problems pertaining to mechanics of particles and systems (70-08) Free motion of a rigid body (70E15) Control of mechanical systems (70Q05)
In the paper under review, the authors examine the De Casteljau algorithm in the context of Riemannian symmetric spaces. The problem of synthesizing a smooth motion of a rigid body or groups of rigid bodies, that interpolates a set of configurations in space, has importance in engineering applications. In this context, a concept of dynamic interpolation, in which the usual interpolation notion is generalized to include the case where the interpolating curves are generated by dynamical systems, is developed (see, for instance, the first author and \textit{J. W. Jackson} [Prog. Syst. Control Theory 8, 156-166 (1991; Zbl 0791.41003)]). Such problems turn out to be more computationally complex than the same problem in Euclidean polynomial interpolation, where computationally efficient algorithms are available to compute the interpolating polynomials. One of these algorithms is the De Casteljau algorithm. In essence, this algorithm is a geometric construction whereby two points in \({\mathbb R}^m\) are joined by a polynomial via an iterative linear interpolation process. This successive linear interpolation does indeed yield a polynomial. Since it is geometrically based, the De Casteljau algorithm can be generalized from \({\mathbb R}^m\) to other spaces, as long as the linear interpolation process is suitably redefined. The goal of this paper is to develop details of the De Casteljau algorithm in the special cases of connected and compact Lie groups and spheres. That one could generalize the concept of the De Casteljau algorithm to arbitrary Riemannian manifolds was first pointed out by \textit{F. Park} and \textit{B. Ravani} [ASME J. Mechan. Design 117, 36-40 (1995)], where usual straight line segments are replaced by geodesic segments. The first objective of the paper under review is to work out a general expression for the first two derivatives of generalized polynomial curves defined by the generalized De Casteljau algorithm, for the special case of compact Lie groups. Thus, this result holds specifically for all of the orthogonal groups \(SO(m)\), \(m\geq 3\), and, in particular, the rotation group \(SO(3)\) in \({\mathbb R}^3\). The second objective is to work out the details of the generalized De Casteljau algorithm on \(m\)-dimensional spheres \(S^m,\quad m\geq 2\). The Lie group \(SO(m+1)\) acts transitively on \(S^m\), and geodesics on \(S^m\) correspond to certain geodesics on \(SO(m+1)\), which are one-parameter groups in \(SO(m+1)\). Thus the algorithm for \(S^m\) can be based upon the somewhat simpler algorithm for \(SO(m+1)\).
- Approximation with the output of linear control systems
- Left Lie reduction for curves in homogeneous spaces
- Data fitting on manifolds with composite Bézier-like curves and blended cubic splines
- \(C^1\) interpolating Bézier path on Riemannian manifolds, with applications to 3D shape space
- The cubic de Casteljau construction and Riemannian cubics
- \( C^1\) and \(G^1\) continuous rational motions using a conformal geometric algebra
- Fractional derivative for interpolation in \(\mathbb{R}^n\) and \(\mathrm{SO}(n)\) applications in functionally graded materials and rigid body transformations
- On parametric smoothness of generalised B-spline curves
- De Casteljau's algorithm on manifolds
- Bézier curves and \(C^{2}\) interpolation in Riemannian manifolds
- On the geometry of rolling and interpolation curves on \(S^n\), \(\mathrm{SO}_n\), and Grassmann manifolds
- \(C^{2}\) spherical Bézier splines
- A two-step algorithm of smooth spline generation on Riemannian manifolds
- Duality and Riemannian cubics
- Numerical algorithms for spline interpolation on space of probability density functions
- An algorithm based on rolling to generate smooth interpolating curves on ellipsoids
- Non-null Lie quadratics in E3
- Rolling maps and nonlinear data
- A New Geometric Algorithm to Generate Smooth Interpolating Curves on Riemannian Manifolds
- Geodesic regression on spheres from a numerical optimization viewpoint
- Rolling Stiefel manifolds
- A gradient-descent method for curve fitting on Riemannian manifolds
- Null cubics and Lie quadratics
- Construction of spline curves on smooth manifolds by action of Lie groups
- A new approach to design the ruled surface
- Theoretical and numerical considerations about Padé approximants for the matrix logarithm
- High-order splines on Riemannian manifolds
- Apollonian de Casteljau-type algorithms for complex rational Bézier curves
- Intrinsic spherical smoothing method based on generalized Bézier curves and sparsity inducing penalization
- Higher-order smoothing splines versus least squares problems on Riemannian manifolds
- De Casteljau's algorithm in geometric data analysis: theory and application
- Shape-based functional data analysis
- Hermite subdivision schemes for manifold-valued Hermite data
- Splines on manifolds: a survey
- Hermite interpolation with retractions on manifolds
- A universal approach to interpolation on reductive homogeneous spaces
- Endpoint geodesic formulas on \(\mathrm{SE}_3\), \(\mathrm{SO}_3 \times \mathbb{R}^3\) and subspaces of \(\mathrm{SE}_3\)
- An implicit time integrator for Cosserat rods based on the spherical Bézier interpolation
- Spherical B-spline interpolation with application to a mixed isogeometric Cosserat rod formulation
- Product of exponentials (POE) splines on Lie-groups: limitations, extensions, and application to \(\mathrm{SO}(3)\) and \(\mathrm{SE}(3)\)
- Polynomial approximations for the matrix logarithm with computation graphs
- Geometrically exact beam finite element with generalized B-spline interpolation on the special Euclidean group SE(3)
- Bézier splines interpolation on Stiefel and Grassmann manifolds
- Task-specific optimal trajectory planning of dual-arm space robot based on convex optimization
- Nonlinear weighted subdivision schemes
- A modified Casteljau algorithm to solve interpolation problems on Stiefel manifolds
- A constructive approximation of interpolating Bézier curves on Riemannian symmetric spaces
- Higher order geodesics in Lie groups
This page was built for publication: The De Casteljau algorithm on Lie groups and spheres
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1972801)
