Abstract
Simple closed formulas for endpoint geodesics on Graßmann manifolds are presented. In addition to realizing the shortest distance between two points, geodesics are also essential tools to generate more sophisticated curves that solve higher order interpolation problems on manifolds. This will be illustrated with the geometric de Casteljau construction offering an excellent alternative to the variational approach which gives rise to Riemannian polynomials and splines.
Keywords:
Graßmannians; Lie group actions; rotations; reflections; endpoint geodesics; de Casteljau Algorithm MSC:
53C22; 53C35; 14M15
1. Introduction
The results in this paper were motivated by the difficulty in obtaining explicit solutions of the Euler-Lagrange equations associated to certain variational problems on Riemannian manifolds. Geometric cubic polynomials (also called Riemannian polynomials) appeared in this context as natural generalizations of Euclidean cubic polynomials to the smooth manifold setting. They are smooth curves required to minimize the intrinsic acceleration among all curves on the manifold that join two given points with prescribed velocities at those points. This problem, first formulated and studied in [], later caught a considerable amount of interest. Without being exhaustive, we mention [,,], and references therein. The Euler-Lagrange equations for the variational problem that gives rise to those curves are highly nonlinear and only in some trivial examples can be solved explicitly. In spite of great efforts mainly made by Noakes and collaborators, to overcome such difficulties, they are still the main drawback of the variational approach.
The classical de Casteljau algorithm [] is a geometric construction to produce cubic Euclidean polynomials and splines based on successive linear interpolation. As an alternative method to the variational approach to obtain splines on manifolds, construction has been generalized to Riemannian manifolds in a very natural manner, simply replacing straight line segments in Euclidean space by their corresponding length-minimizing curve segments, namely segments of geodesics; we refer for instance to [,,,]. Whereas in the Euclidean case the curves generated by this approach coincide with those obtained by the variational approach, the same does not happen for non-flat spaces. In the more recent work [], however, the authors were able to make some adjustments in the de Casteljau construction to obtain curves closer to the Riemannian polynomials. The main relevance of our alternative approach is that it generates curves that can be expressed in closed form as long as one has available simple explicit formulas for the geodesic that joins two given points.
In this paper, we concentrate on interpolation on Graßmann manifolds (or Graßmannians). These manifolds model the space of subspaces of a fixed dimension within a larger vector space, and for that reason can be used to represent and analyze, e.g., subspaces defined by certain image features in image processing. More generally, Graßmannians find applications, for instance, in computer vision tasks such as image and video analysis, object recognition, and motion estimation. In medical imaging, Graßmannians are used as well to capture and analyze deformations in anatomical structures. See, for instance [,], and references therein.
Our first objective is to find simple formulas for the geodesic in a Graßmannian that joins two given points. They will then be used to implement the de Casteljau algorithm on these manifolds. An explicit formula that was derived in [] involves computing matrix exponentials and logarithms and is, for that reason computationally expensive. Here, we will present much simpler formulas, where essentially only constant, linear and quadratic functions of the given points are involved, together with some scalar trigonometric functions.
The organization of the paper is as follows. After setting notations and recalling the necessary background respectively in Section 2 and Section 3, Section 4 starts with two different but diffeomorphic faithful matrix representations of Graßmannians. It also includes results that are at least partially well-known, however, a detailed description in text books is still missing. We therefore present them for the reader’s convenience to make this paper sufficiently self contained, and nevertheless refer to the unpublished lecture notes [,]. In Section 5, simple closed formulas for endpoint geodesics in the Graßmannian are derived, first using rotations and then via reflections. The formulas for projective space can be more easily obtained from endpoint geodesic formulas for the unit sphere. So, such formulas are derived first for the sphere in Section 6 and then applied to projective space in Section 7. Nevertheless, the presented formulas for specialize to those of projective spaces by just setting , as well. Finally, in Section 8 we recall the de Casteljau algorithm for geodesically complete manifolds, and write explicit expressions for cubic polynomials in the orthogonal group and in the Graßmannian in order to compare them. Our last result gives evidence that the representation of Graßmannians by reflections is a totally geodesic submanifold of the orthogonal group. In particular, this means that the de Casteljau algorithm on induces already the procedure on by restriction, if the input data was appropriately chosen.
2. Notations
Our notations are fairly standard. In this paper, Lie groups are denoted by capital letters, , etc., and are assumed to be subgroups of the general linear group of real -matrices , i.e., linear Lie groups, exclusively identified here by their defining matrix representations. When referring to particular cases, we use their classical notation, as in the following list:
Real vector spaces are denoted by capital letters, e.g., V. If they are subspaces of a given Lie algebra, say , we also use fractured letters, e.g., . A specific subspace of is in particular
Correspondingly, the Lie theoretic operators and Ad are defined as usual, i.e., for any element X in the Lie algebra , and any g in the linear Lie group G having as its Lie algebra,
For convenience, we may interchangeably use two different notations, and , for the matrix exponential of .
The Euclidean (Frobenius) inner product is denoted by , for any . Here, denotes the matrix trace and denotes the matrix transpose.
3. Background and Settings
Lie Groups, Their Actions, Associated Homogeneous Spaces, Naturally Reductive Spaces
We review some important facts about Lie groups and homogeneous manifolds, with particular emphasis on naturally reductive spaces to guarantee the existence of geodesics that join two given points. We refer to [,] for more details.
Let M be a smooth manifold on which a Lie group G acts transitively through the (left) action . That is, if e denotes the identity element in G, then
for all , and all . With these properties, M becomes a homogeneous space. We denote by the diffeomorphism on M. If is a point in M, then is a closed subgroup of G called the isotropy subgroup (or stabilizer) of , and any two isotropy subgroups are conjugate. To simplify notations, if there is no possibility of confusion, we denote an isotropy subgroup simply by K. M can be regarded as the quotient since the mapping is a diffeomorphism of onto M. The canonical projection is given by .
We now specialize to some particular homogeneous spaces, starting with the notion of reductive space.
Definition 1.
is said to be a reductive space if there exists an -invariant subspace of the Lie algebra of G that is complementary to the Lie algebra of K in .
According to this definition, the following holds for a reductive space:
Moreover, the canonical projection of G on M and its differential at , , have the following properties:
- is a submersion, such that is a linear isomorphism and ;
- induces a one-to-one correspondence between -invariant inner products on and G-invariant metrics on M.
- A reductive space is not necessary geodesically complete. In order to deal with the endpoint geodesic problem we consider another subclass, namely, the set of so-called naturally reductive homogeneous space.
Definition 2.
A naturally reductive homogeneous space is a reductive space such that, for all ,
where is the inner product on associated to the G-invariant metric on M, and denotes the -component of the Lie bracket in .
Definition 3.
A smooth curve on G is said to be horizontal if , where denotes the velocity vector and is the vector space in (5). A smooth curve on G is called a horizontal lift of a curve in the naturally reductive homogeneous space if it is horizontal and projects onto , i.e., .
The following proposition gives an explicit formula for the geodesic in a naturally reductive homogeneous space that starts at a point with a prescribed velocity.
Proposition 1.
Let be a naturally reductive homogeneous space. The geodesic , starting at with initial velocity , is defined for all by
Proof.
See for instance, [] (p. 313), or [] (p. 708.) □
Remark 1.
In the following two sections, in particular in Section 5.2, we exploit properties of an even more structured subclass of naturally reductive homogeneous spaces, namely so-called symmetric spaces. We refer to [,] for a thorough introduction. Those properties of symmetric spaces that we actually use will be explained in more detail below. Examples of symmetric paces, and therefore of naturally reductive spaces as well, are, for instance, , , Graßmannians, projective spaces and spheres, the only cases that will be considered in this paper.
4. Graßmannians
The -based, or alternatively -based, coset descriptions (group models) of the real Graßmannian are well-known, see [], to be
The smooth manifold is defined as the set of all proper k-dimensional subspaces of an n-dimensional Euclidean space, the latter as usual identified with . The orthogonal groups and act transitively on . The “denominators” (or ) then denote the stabilizer subgroups, respectively, of an arbitrary k-dimensional subspace. To derive simple formulas for endpoint geodesics in , we aim to have an explicit description of in terms of matrices, preferably realized as elements of an isometrically embedded submanifold of some Euclidean vector space or even as an isometrically embedded submanifold of . Eventually, the first submanifold is the set of rank-k orthogonal projection operators, the second is the set of matrices in with trace equal to .
Ultimately, we end up with two isometric matrix models of the (abstract) Graßmannian . The first one we call projection model, the second one we call reflection model, see [].
Two Faithful Representations for the Graßmannian
We start with the projection model of the Graßmannian , considered as Riemannian submanifold
That is, points on are identified by rank-k orthogonal projection operators and is endowed with Euclidean inner product, namely the Frobenius inner product. Standard results from differential geometry and Lie theory ensure that and are diffeomorphic. In particular, the “matrix manifold” is a smooth and compact submanifold of , being an orbit of the orthogonal groups and , by a smooth group action, i.e., conjugation. In this setting, everything is formulated somehow in standard matrix language.
We recall formulas for tangent and normal spaces and some of their geometric interpretations, many of them well-known, sometimes scattered over the literature, but we refer to [,] and references therein for more details.
The content of the following lemma will be particularly useful in the last section.
Lemma 1.
If and satisfies , then for all ,
and, consequently,
Proof.
Expanding the series and comparing powers proves the result. □
We also define the orthogonal projection of a symmetric matrix into the tangent space of the Graßmannian at P by
In similar fashion, the normal space is defined by
The reflection operator at the normal space we define as
Remark 2.
Note that, since ,
That is,
Additionally,
so, in particular, is a symmetry of .
The second model of , the reflection model, now comes by identifying uniquely a projection operator with a (generalized) reflection
That is,
The following properties are easily verified,
in particular, is an involution. It depends only on k, i.e., on , whether lies in the connected component of the identity, i.e., in the subgroup or instead in the second connected component . In this model, is considered as a Riemannian submanifold of one of the two components of , equipped with Killing form (i.e., scaled Frobenius inner product as Riemannian metric). Now, by construction, the abstract Graßmannian (with , to ignore trivial cases), considered as the homogeneous space endowed with metric induced by the scaled Killing form is isometric to both of our two models and . Formally, one might feel tempted to write
The formulas for tangent and normal spaces for , as well as for projections and reflections, are then straightforward. For the sake of completeness, we next list those formulas omitting a detailed derivation. Consider arbitrary .
Clearly, for one has , where was defined by (17).
Remark 3.
In numerics, could be preferable to , because the embedding space is slightly smaller, as , but this fact we ignore.
Remark 4.
Because Graßmannians are also symmetric spaces, according to [] there is a multiplication available.
For any the multiplication map for the reflection model is
The corresponding multiplication formula for in terms of the projections , is as
5. Endpoint Geodesics for Graßmannians
We are interested in closed formulas specifying a minimal geodesic, that connect an arbitrary point with another point , given purely in terms of these points. For this objective it is important to recall the concept of cut locus []. In case of the recent treatment [] gives a nice overview and also points to some incomplete results from the past, see also the references therein. The cut locus of a given is easily seen to be the subset consisting exactly of those points which fulfill . A nice interpretation is in terms of the k principal angles between the associated subspaces of P and Q.
Remark 5.
From now on we will always assume . Such an assumption does not cause any restriction, as it is well-known that and are diffeomorphic, most easily seen by recognizing the one-to-one correspondence between any k-dimensional subspace of and its associated -dimensional complementary counterpart.
5.1. Closed Formulas for Endpoint Geodesics in Graßmannians, via Rotations
Geodesics on starting at P with initial velocity are of the form
We also know, from [], that the geodesic satisfying , is given by
The formula was generalized in [] for symmetric spaces and named endpoint geodesic formula.
To find the geodesic that joins P with Q using the previous formula, requires to compute the matrix logarithm to get B and the matrix exponential to get . However, these operations are very computationally expensive.
Our objective is to overcome the complexity of computing those matrix functions. For that, we find simple closed formulas for B, V, , , and finally for the corresponding geodesic that reaches a point Q at , where only constant, linear and quadratic functions in the data points P and Q, and scalar trigonometric functions are involved. However, first we need some preparation.
Points in the Stiefel manifold,
can be projected to , via , and this fact will be used here.
Consider , with and with appropriately chosen . We moreover assume that . By the transitive action of on there exists a such that
Up to a basis change a “Stiefel representative” p for the projection can be fixed by setting
By the assumptions there is a unique minimal geodesic
We will fix q as well by setting . We compute
The orthogonal can be further specified by requiring
Here, we have restricted the above from (37) by considering a singular value decomposition of , with , . By the assumption we have with . We now compute
From (42) we also see immediately that
Theorem 1.
For the geodesic that joins with , we have
Proof.
Exploiting (43) proves the statement. □
Remark 6.
Note that by the assumption that all principal angles , lie in the half open intervall . The “formal” matrix quotient of diagonal matrices
is well defined and therefore makes sense.
In addition, note that in our context the diagonal -matrix might be not invertible, as for its k diagonal entries, i.e., the sines of the principal angles, we have . However, the formal matrix quotient still makes sense as for one has .
Corollary 1.
Proof.
Corollary 2.
Proof.
This follows immediately from inserting formula (47). □
Corollary 3.
Proof.
We compute
thus verifying the claim.
Here, we used at several instances trigonometric identities (e.g., addition theorems) and the fact that for any real t we have the scalar limit . The latter is in particular important to notice, as the diagonal matrix is not necessarily invertible. □
Corollary 4.
Proof.
This is a straightforward but clumsy computation. First postmultiply by P exploiting and , secondly, postmultiply with its own transpose, because must hold; the result will follow. □
Remark 7.
One possible strategy to obtain from P and Q is to compute the nonzero singular values of or , as they are equal to the sines of the nonzero principal angles between the subspaces associated to P and Q, see, e.g., Thm. 4.37 in [].
Remark 8.
Sometimes, in applications, Stiefel representatives p and q with and are already given. If this is not the case a possible strategy to compute p out of by a finite number of steps is as follows. Partition into appropriate subblocks, where obviously must hold. We look only to the case where exists. Consider the (unique) Cholesky decomposition . Then serves the purpose.
5.2. Closed Formulas for Endpoint Geodesics in Graßmannians, via Reflections
We now sketch an alternative way to express geodesics on Graßmannians explicitly, and consequently also the corresponding . For that, reflection operators, defined in (17) and (18), play an important role. We already showed in Lemma 1 that these operators are reflections on Graßmannians, but they are actually geodesic reflections, that is, if is a geodesic in , starting at the point , then
This is easily seen using the definition of a reflection, the explicit formula for the geodesic, and identity (14). Indeed,
In a similar way, one checks that the geodesic , in , starting at the point P, can be expressed in terms of reflections at the normal space at . More precisely,
The previous formula for Graßmannians is a particular case of a more general result for symmetric spaces. In addition to the many further properties, they enjoy a more restrictive geodesic symmetry, as they are characterized by having geodesics which are induced by one-parameter subgroups of the group which acts transitively, as stated in Proposition 1.
The general idea, that can be found in [], Chapter XI, is the following. If is a geodesic on a symmetric space M, starting at , and denotes the geodesic symmetry of M at P, then is a one-parameter group of isometries of M whose orbit through is the geodesic itself. The group operations are
with identity element , and inverse .
Consequently, for the Graßmannian one has
Geodesics in can now expressed explicitly in terms of reflections.
Corollary 5.
The geodesic in , joining the point P (at ) with the point Q (at ), is given by , with
where
Proof.
The last formula is obtained by setting in (52), followed by using simple trigonometric identities. □
In (34) we have an implicit formula for the matrix B, which is . However, we now also have a formula for taking the square root of the previous, purely in terms of p and q.
Corollary 6.
Consider the minimal geodesic connecting with and define the midpoint .
For , we have
Proof.
Remark 9.
The results in this section can be applied to the particular situation when , in which case . However, they can be more easily obtained from similar computations on the unit sphere. So, we derive next closed formulas for the minimal geodesic connecting points in the sphere , from where corresponding formulas for the projective space will follow.
6. A Faithful Representation of the Unit Sphere
Some fifty years ago in [] an explicit construction for an isometric embedding of the Graßmannian was presented, see, however, [] for additional details. If we would try to mimic this construction for the sphere , we would run into trouble, simply because we would necessarily end up with projective space rather than with a faithful representation of . The reason is that the corresponding quadratic map
is not injective, e.g., for any with we have . There is, however, a neat way out by means of Clifford algebras, the reader might consult Chapter I.6.6 in [] for details.
We therefore proceed by considering as a Riemannian submanifold with induced Euclidean metric in the usual way. The following formulas and definitions for tangent and normal subspaces, associated projection operators, reflections at normal spaces, group action and multiplication map are well-known.
6.1. Closed Formula for Endpoint Geodesics in the Unit Sphere , via Rotations
We are interested in closed formulas related to the unique minimal geodesic on the sphere, that joins two non antipodal points, given purely in terms of these points. The next theorem summarizes our results.
Theorem 2.
Let with . Denote by the unique minimal geodesic with , and . The latter can be made unique by using with suitably chosen. Closed formulas for unique , , , and , given purely in terms of starting point p and endpoint q are as follows.
Proof.
The idea is to bring simultaneously to some suitable normal form. By transitivity of the -action on there exists a and a suitable angle such that
In other words, the -problem somehow reduces to an -problem, considered as lying in the 2-plane spanned by and the origin of the embedding space . Elementary geometry then tells us that
Moreover, by assumption, implying
We proceed by identifying the orthogonal from . From (71) we have
Consequently, using
we have
showing (68). Furthermore, from the first equality in (76) we can identify as well. Indeed,
verifying (67). It remains to prove the formula for . We have the representation
easily verified by expanding the power series and comparing terms. Inserting (77) into (78) gives
showing (69) as .
Finally, to verify formula (70) is straightforward by using appropriate trigonometric addition formulas, we omit the details. □
Remark 10.
Formula (70) appeared already in [], however, without proof.
6.2. Closed Formula for Endpoint Geodesics in the Unit Sphere , via reflections
Lemma 2.
Let with . Denote by γ the unique minimizing geodesic connecting p with q and and . Define the “midpoint” . Then we have
with reflection operator at the normal space given explicitly in terms of p and q only by
Proof.
It is sufficient to prove the statement for with and and . The details are straightforward to verify by using Theorem 2 and are therefore omitted. □
For applications it is sometimes useful to have a parameter dependent representation of the reflection with as well.
Corollary 7.
We have the representation
Proof.
The result follows from (70). □
Remark 11.
Certainly, Lemma 2 follows from Corollary 7 for as well.
7. Formulas for Geodesics in the Projective Space
Theorem 3.
Let with P neither lying in the cut locus of Q with , and , nor P being conjugate to Q. Let . Consider the minimal geodesic connecting and . Then
Proof.
Corollary 8.
Sometimes it is useful to have a formula for the tangent vector at P specifying together with P the unique minimal geodesic connecting P and Q,
Proof.
This is a straightforward computation using (85) and is therefore omitted. □
Lemma 3.
Consider two points with . Let . Consider the minimal geodesic
Consider the midpoint . Then we have
and the reflection operator at the normal space is given explicitly in terms of P and Q only by
where
Proof.
By the transitive action we know that there exists a with , and , , moreover, see also (75), we have . We compute
□
Corollary 9.
With notations as in Lemma 3 we have the representation
with
Proof.
The result follows from the last expression in (86) using instead of t. □
8. The de Casteljau Algorithm on Riemannian Manifolds
A well-known recursive procedure to generate polynomial curves in Euclidean spaces is the classical de Casteljau algorithm which was introduced, independently, by de Casteljau [] and Bézier []. The algorithm is a simple and powerful tool widely used in the field of Computer Aided Geometric Design (CAGD), and is based on successive linear interpolations, see [] for a treatise.
A generalization of that algorithm to Riemannian manifolds appeared first in [], and the basic idea was replacing linear interpolation by geodesic interpolation. The resulting curves are also called polynomial curves as they are natural extensions to Riemannian manifolds of Euclidean polynomials. In Euclidean spaces, the most important are the cubic polynomials, due to their optimal properties, as they minimize acceleration.
Generating polynomial curves and polynomial splines on manifolds was motivated by problems related to path planning of certain mechanical systems, such as spacecraft and underwater vehicles, whose configuration spaces are non-Euclidean manifolds. The rotation group, which plays an important role in this context, inspired further developments such as the work in [] that will be used here. However, first we briefly describe the de Casteljau algorithm to generate cubic polynomials on Riemannian manifolds, assuming that they are geodesically complete.
8.1. Generating Cubic Polynomials
A cubic polynomial is a smooth curve that satisfies a two-point boundary value problem (initial and final points and velocities are prescribed), but may be generated from four distinct points in M, the first and last being respectively the initial and final point of the curve and the other two are auxiliary points for the geometric algorithm, but are related to the prescribed velocities. Without loss of generality, we are going to parameterize the curves over the interval .
The next algorithm describes all steps of this construction, illustrated in Figure 1.
Figure 1.
Illustration of the de Casteljau algorithm. Cubic polynomial in blue.
The curve obtained in Algorithm 1 is called cubic polynomial in M, and in Figure 1 it is represented by the blue curve. It is important to observe that this curve joins the points (at ) and (at ), but does not pass through the other two points and . The latter are called control points, since they influence the shape of the curve.
| Algorithm 1 Generalized de Casteljau algorithm |
|
Since the basic ingredients used in the de Casteljau algorithm are geodesic arcs, Riemannian geometry provides enough tools to formulate this construction theoretically. However, often those simple curves are implicitly defined by a set of nonlinear differential equations, so Algorithm 1 can be practically implemented only when the calculation of the geodesic arcs can be reduced to a manageable form.
This algorithm can be generalized to generate polynomials of any degree and also to generate -smooth cubic polynomial splines by piecing together, in a sufficiently smooth manner, several cubic polynomials. These curves are particularly useful in many engineering applications.
8.1.1. Cubic Polynomials in Graßmannians
Cubic polynomial curves on were derived in [], using the generalized de Casteljau algorithm above. The next result contains the explicit formula for such curves. We call attention to the meaning of the superscripts in the operators that appear in the next proposition. Those superscripts have been chosen to agree with the step number of the algorithm where they are defined, and that will become clear in Remark 12.
Proposition 2.
Given four distinct points , for , in , the curve
where, for and ,
is the cubic polynomial in , obtained by the generalized de Casteljau algorithm associated to the points , with . Moreover, for every ,
Proof.
See []. □
Remark 12.
We briefly explain how Algorithm 1 generates the curve (95), subject to (96) and (97). For that, we use formula (34) for the geodesic arc that joins two given points, and identity (14).
In Step 1, the geodesic arc joining to is given by , where . Taking into account identity (14), it is clear that the first condition in (97) holds.
In Step 2, we obtain with
Replace in (100), by , by its expression above, using (14), we get
which is the second expression in (96) for .
Moreover, the equality in the first line of (101) and (14) enables to conclude that the second condition in (97) holds for .
Similar arguments can be used to obtain the other geodesic arc in Step 2 and the one in Step 3, together with the corresponding constraints in (97).
For the sake of completeness, we also include here the relationship between the control points and and the initial and final velocities of the curve (95), see [].
The cubic polynomial that satisfies the boundary conditions
with , for , satisfying , is generated by the de Casteljau algorithm associated to the points , where the controls points are given in terms of the boundary data (102) as:
Remark 13.
Although the formulas in Proposition 2 appear to be relatively manageable, they are not appropriate for the implementation of the algorithm due to their computational cost. It is exactly to overcome this burden that the formulas derived in Section 5.1 can be extremely useful.
8.1.2. Orthogonal Cubic Polynomials
Here, we present the cubic polynomials generated by the de Casteljau algorithm when . This follows immediately from the work in [], which was dedicated to connected and compact Lie groups and to spheres. The only difference here is that we have to assume that the initial data (the given four points) lives in one of the two connected components of the orthogonal group, in which case the resulting cubic stays in that component. Here, we use capital greek letters for points in , capital Roman letters for elements in its Lie algebra and, for convenience, denote the curves in the de Casteljau algorithm by instead of . As in the Graßmannian case, the superscripts in the operators that appear in the next proposition have been chosen to agree with the step number of the algorithm where they are defined. This will become clear in Remark 14.
Proposition 3.
Given four distinct points , , in one of the two connected components of , the curve defined by
where , for , is the infinitesimal generator of the geodesic arc joining the point (at ) to (at ), that is, , and for every the Lie algebra elements are defined by:
is the cubic polynomial in generated by the de Casteljau algorithm, associated to and .
Proof.
See []. □
Remark 14.
To check that Algorithm 1 generates the curve (104), subject to (105), it is enough to look at the expressions for the curves obtained in each of the three steps, taking into consideration the formula for geodesic arcs that join two given points in the orthogonal group.
In Step 1, the geodesic arc joining to is given by , where .
In Step 2, we obtain with . However, the last identity is equivalent to , or to
Similarly, the second geodesic arc is , with
In Step 3, , with =.
Taking into consideration that and , it simplifies to .
The relationship between the control points and and the initial and final velocities of the curve (104) follows immediately from Theorem 2.5 in [], which states that
Indeed, the cubic polynomial that satisfies the boundary conditions
can be generated by the de Casteljau algorithm with controls points
8.1.3. Comparing Cubic Polynomials in with Cubic Polynomials in Graßmannians
We take advantage of the fact that lives in to compare the cubic polynomial in Proposition 2 with the orthogonal cubic polynomial in Proposition 3.
Theorem 4.
Let be the cubic polynomial in associated to the points , , given in Proposition 2, and the cubic polynomial in associated to the points , given in Proposition 3. Then,
Proof.
First we show that when , we have , where the are as defined in Proposition 3 and the as defined in Proposition 2. Indeed,
and comparing with the first identity in (96) we conclude that , . Using these relationships and the second identity in (96), we can write
So, , for . Similarly, using these relations and the second identity in (96), with , we conclude that . So, since
satisfies all the constraints in Proposition 2, also
satisfies all the constraints in Proposition 3.
Finally, we prove the relationship between and , systematically using the result in Lemma 1 and the constraints (97). Indeed,
□
Remark 15.
Since is a submanifold of , the last result tells us that if holds for all data points, the whole de Casteljau construction in actually takes place inside . This observation is due to two important facts. First of all, the de Casteljau algorithm is solely based on recursive geodesic interpolation. Secondly, is a totally geodesic submanifold of , since any geodesic in is a geodesic in . Indeed, every geodesic in that starts at a point , , is of the form , with satisfying . However, due to the second identity in Lemma 1, , which is a geodesic in .
9. Conclusions
In this work we have considered the so-called endpoint geodesic problem on Graßmannians. We presented explicit and closed fromulas for connecting two nonconjugate points on the real Graßmannian by a unique minimizing geodesic. The approach goes beyond earlier work as matrix exponentials and logarithms can be avoided. The special cases of projective spaces and unit spheres were handled as well. These results were applied to the important interpolation problem of implementing the de Casteljau algorithm on Graßmannians via iterated geodesic interpolation.
Author Contributions
The author’s contributions to this paper are equally distributed. All authors have read and agreed to the published version of the manuscript.
Funding
The work of the first author has been supported by German BMBF-Projekt 05M20WWA: Verbundprojekt 05M2020-DyCA. The work of the second author has been supported by Fundação para a Ciência e Tecnologia (FCT) under the project UIDP/00048/2020.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Acknowledgments
The authors thank Ralf Zimmermann, SDU Odense, Denmark, for fruitful discussions about Stiefel representatives and projection matrices.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Noakes, L.; Heinzinger, G.; Paden, B. Cubic splines on curved spaces. IMA J. Math. Control Inf. 1989, 6, 465–473. [Google Scholar] [CrossRef]
- Crouch, P.; Silva Leite, F. The dynamic interpolation problem: On Riemannian manifolds, Lie groups, and symmetric spaces. J. Dyn. Control Syst. 1995, 1, 177–202. [Google Scholar] [CrossRef]
- Camarinha, M.; Silva Leite, F.; Crouch, P. On the geometry of Riemannian cubic polynomials. Differ. Geom. Its Appl. 2001, 15, 107–135. [Google Scholar] [CrossRef]
- Popiel, T.; Noakes, L. Bézier curves and C2 interpolation in Riemannian manifolds. J. Approx. Theory 2007, 148, 111–127. [Google Scholar] [CrossRef]
- De Casteljau, P. Outillages Méthodes Calcul. Technical Report—André Citroën Automobiles SA. 1959. [Google Scholar]
- Park, F.; Ravani, B. Bézier Curves on Riemannian Manifolds and Lie Groups with Kinematics Applications. ASME J. Mech. Des. 1995, 117, 36–40. [Google Scholar] [CrossRef]
- Crouch, P.; Kun, G.; Silva Leite, F. The De Casteljau algorithm on Lie groups and spheres. J. Dynam. Control Syst. 1999, 5, 397–429. [Google Scholar] [CrossRef]
- Zhang, E.; Noakes, L. Optimal interpolants on Grassmann manifolds. Optim. Interpolants Grassmann Manifolds. Math. Control Signals Syst. 2019, 31, 363–383. [Google Scholar] [CrossRef]
- Zhang, E.; Noakes, L. The cubic de Casteljau construction and Riemannian cubics. Comput. Aided Geom. Des. 2019, 75, 101789. [Google Scholar] [CrossRef]
- Alashkar, T.; Ben Amor, B.; Daoudi, M.; Berretti, S. A Grassmann framework for 4D facial shape analysis. Pattern Recognit. 2016, 57, 21–30. [Google Scholar] [CrossRef]
- Shi, X.; Styner, M.; Lieberman, J.; Ibrahim, J.G.; Lin, W.; Zhu, H. Intrinsic Regression Models for Manifold-Valued Data. In Proceedings of the Medical Image Computing and Computer-Assisted Intervention (MICCAI), London, UK, 20–24 September 2009; Yang, G., Hawkes, D., Rueckert, D., Noble, A., Taylor, C., Eds.; Springer: Berlin/Heidelberg, Germany, 2009; Volume 5762, pp. 192–199. [Google Scholar]
- Batzies, E.; Hüper, K.; Machado, L.; Silva Leite, F. Geometric Mean and Geodesic Regression on Grassmannians. Linear Algebra Its Appl. 2015, 466, 83–101. [Google Scholar] [CrossRef]
- Eschenburg, J.H. Lecture Notes on Symmetric Spaces. Available online: https://myweb.rz.uni-augsburg.de/~eschenbu/symspace.pdf (accessed on 11 August 2023 ).
- Ziller, W. Lie Groups. Representation Theory and Symmetric Spaces. Available online: https://www2.math.upenn.edu/~wziller/math650/LieGroupsReps.pdf (accessed on 11 August 2023 ).
- O’Neill, B. Semi-Riemannian Geometry with Applications to Relativity; Academic Press, Inc.: New York, NY, USA, 1983. [Google Scholar]
- Gallier, J.; Quaintance, J. Differential Geometry and Lie Groups. A Computational Perspective; Springer: Cham, Switzerland, 2020. [Google Scholar]
- Loos, O. Symmetric Spaces. II: Compact Spaces and Classification; W. A. Benjamin, Inc.: New York, NY, USA; Amsterdam, The Netherlands, 1969. [Google Scholar]
- Loos, O. Symmetric Spaces. I: General Theory; W. A. Benjamin, Inc.: New York, NY, USA; Amsterdam, The Netherlands, 1969. [Google Scholar]
- Onishchik, A.L. Topology of Transitive Transformation Groups; Johann Ambrosius Barth: Leipzig, Germany, 1994. [Google Scholar]
- Helmke, U.; Hüper, K.; Trumpf, J. Newton’s Method on Graßmann Manifolds. arXiv 2007, arXiv:0709.2205. [Google Scholar]
- Lee, J.M. Introduction to Riemannian Manifolds, 2nd ed.; Springer: Cham, Switzerland, 2018. [Google Scholar]
- Bendokat, T.; Zimmermann, R.; Absil, P.A. A Grassmann Manifold Handbook: Basic Geometry and Computational Aspects. arXiv 2020, arXiv:2011.13699. [Google Scholar]
- Stegemeyer, M. Endpoint Geodesics in Symmetric Spaces. Master’s Thesis, Institut für Mathematik, Julius-Maximilians-Universität Würzburg, Würzburg, Germany, 2020. [Google Scholar]
- Stewart, G. Matrix Algorithms. Vol. 1: Basic Decompositions; Society for Industrial and Applied Mathematics (SIAM): Philadelphia, PA, USA, 1998. [Google Scholar]
- Kobayashi, S.; Nomizu, K. Foundations of Differential Geometry; John Wiley & Sons, Inc.: New York, NY, USA, 1996; Volume 2. [Google Scholar]
- Kobayashi, S. Isometric imbeddings of compact symmetric spaces. Tôhoku Math. J. 1968, 20, 21–25. [Google Scholar] [CrossRef]
- Bertram, W. The Geometry of Jordan and Lie Structures; Springer: Berlin/Heidelberg, Germany, 2000. [Google Scholar]
- Bézier, P. The Mathematical Basis of the UNISURF CAD System; Butterworths: London, UK, 1986. [Google Scholar]
- Farin, G.; Hansford, D. The Essentials of CAGD; CRC Press: Boca Raton, FL, USA, 2000. [Google Scholar]
- Pina, F. Interpolation in the Generalized Essential Manifold. Ph.D. Thesis, Department of Mathematics, University of Coimbra, Coimbra, Portugal, 2020. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).