Locally generated $\mathcal{C}^1$-splines over triangular meshes
Laszlo Stach\'o

TL;DR
This paper classifies all local linear methods for constructing polynomial $C^1$-splines over triangular meshes with specific shape and data-fitting properties, identifying a unique degree-5 procedure and its higher-degree perturbations.
Contribution
It provides a complete classification of local linear $C^1$-spline procedures over triangular meshes with specific shape and data-fitting constraints, highlighting a unique degree-5 method.
Findings
Identifies a unique degree-5 $C^1$-spline procedure.
Classifies all admissible local linear spline procedures.
Shows higher-degree procedures are perturbations of the degree-5 method.
Abstract
We classify all possible local linear procedures over triangular meshes resulting in polynomial -spline functions with affinely uniform shape for the basic functions at the edges, and fitting the 9 value- and gradient data at the vertices of the mesh members. There is a unique procedure among them with shape functions and basic polynomials of degree 5 and all other admissible procedures are its perturbations with higher degree.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques · Iterative Methods for Nonlinear Equations · Composite Structure Analysis and Optimization
Locally generated polynomial -splines
over triangular meshes
L.L. STACHÓ
Abstract. We classify all possible local linear procedures over triangular meshes resulting in polynomial -spline functions with affinely uniform shape for the basic functions at the edges, and fitting the 9 value- and gradient data at the vertices of the mesh members. There is a unique procedure among them with shape functions and basic polynomials of degree 5 and all other admissible procedures are its pertubations with higher degree.
000Received March 29, 2019. AMS 2010 Subject Classification: 65D07, 41A15, 65D15. Key words: Polynomial -spline, triangular mesh, gradient data.
1. Introduction
By a triangular mesh we mean a finite family of closed non-degenerate triangles on the plane with pairwise non-intersecting interiors and admitting only common vertices or edges. As usually, we regard as the set of all real couples considered also as (row) matrices. We shall use the standard notations , and for the Cartesian coordinates and scalar product, respectively. We write for the norm of and for the convex hull of resp. for -determinants. Given a triangular mesh {\cal T}=\big{\{}{\bf T}_{1},\ldots,{\bf T}_{M}\big{\}}, in the sequel and will denote the sets of vertices resp. closed edges of the mesh members, furhermore will stand for the domain covered by , the line figure covered by all edges and the collection of all vertices, respectively. Recall that, given a gradient-data
[TABLE]
on the set of the vertices in , a function is a -extension of on if has a continuous gradient {\bf p}\mapsto\nabla f({\bf p})=\big{[}\frac{\partial}{\partial x}f({\bf p}),\frac{\partial}{\partial y}f({\bf p})\big{]} on which admits a continuous extension to as well (denoted also by ) such that
[TABLE]
A -extension of is said to be a -spline interpolation of with respect to the mesh if the restrictions are polynomials of the coordinate functions .
There exists a large variety of -splines for any admissible and which can be obtained e.g. as global polynomial extensions with Hermite type interpolation [5]. Obviously global polynomial fitting may primarily be interesting only from a pure theretical view point due to too large polynomial degree and hence high numerical instability. A better alternative could be an imitation of tensor product splines (e.g. with Catmull-Rom type hermition curves on edges developed for rectangular meshes [7,6]). This consists the construction of -splines as linear combinations on the rectangular mesh members from affine images of tensor products from only two special polynomials (actually , ). Some main features of tensor product spline procedures which can naturally be generalized even to procedures
[TABLE]
furnishing -spline interpolation functions from gradient data at the vertices over triangular meshes can be formulated in Postulates A,B below.
Postulate A. (Linearity and being locally generated). There are polynomial functions
[TABLE]
depending only on the couple of the triangle with a distingvished vertex such that the restriction of S to any mesh triangle has the form
[TABLE]
If Postulate A holds and , in terms of the canonical frame vectors
[TABLE]
we necessarily have
[TABLE]
The first statement in is immediate from (1.3), while the second one is a consequence of the fact that given any point forming an adjacent triangle , for the mesh with gradient data for we must have on and hence also on the common edge of the triangles .
Locally generated linear spline procedures have the computational advantage that the resulting functions can be calculated on any mesh triangle regardless to what happens at vertices outside. A practical disadvantage is that in most cases only function values are available (mostly from scanned data) and convenient gradient values must be guessed or found by optimizing procedres.
Postulate B. (Uniform shape on edges). * holds and there are polynomial functions such that*
[TABLE]
and the graps of the basic functions on the edges of the triangle are affine images of the graph of , and those of are affine images of the graph of .
That is, under Postulate B, for the generic points on the edge , resp. on we have
[TABLE]
while for the points on the edge we simply have
[TABLE]
In the sequel we call the shape functions of the spline procedure satisfying Postulate B. Notice that the requirements follow automatically from the order condition on the edge .
At first glance, shape uniformity may seem an artificial requirement. However, for a procedure satisfying Postulate A, the geometrically natural property of being invariant with respect to homothetic transformations maps of the form with some orthogonal matrix implies Postulate B trivially. In our context we understand invariance as follows: given a surjective affine transformation with some invertible -matrix of the plain, the spline procedure is -invariant if it transfers spline functions constructed with the gradient data of any smooth function on from to the analogous objects with on , that is
[TABLE]
As we shall see (Lemma 4.1), if Postulate A holds, we can formulate -invariance in terms of the basic functions as follows:
[TABLE]
It is worth to notice (Corollary 4.4) that cannot hold simultaneously for all invertible matrices and . Thus there is no local linear spline procedure which is invariant under all invertible affine transformations and producing always -smooth functions (i.e. functions being continuously differentiable also over the edges of mesh triangles) functions.
Our aim in this paper is a parametric classification of the procedures satisfying Postulates A,B, resulting in -smooth functions. In particular we enumerate all the homothetically invariant linear local polynomial -spline interpolation procedues from gradient data over triangular meshes. It is remarkable that there is a unique one among them with lawest degree (degree 5) which turns out to be homothetically invariant. From the view point of applications, the results provide the complete list of hermition -splines with shape uniformity over edges from which one can choose the best fit one with respect to various aspects. It is worth to relate the latter fact to a celebrated alternative local linear polynomial spline interpolation procedure on the basis of Zlámal-Ženišek 2-nd order triangular spline equations [9]. This relies upon the fact that, given a triangular mesh with gradient and Hessian data at the vertices and normal derivative values at edge middle points, there is a unique fitting spline with 5th degree polynomials. The 21 polynomial coefficients over any mesh triangle can be obtained as the unique solution of a system of 21 straightforward linear equations whose explicit formula was published recently [8]. Though not stated in the sources, easily seen this kind of procedure has some homothetical invariance properties. Hence it seems that our first order approach with the shape conditions of Postulate B provides a geometrically motivated alternative to several problems discussed in [8]. As mentioned earler and remarked also e.g. in [1], first order approches with a few (actually 9 in [1]) free parameters may have practical advantages versus higher oreder methods due to the fact that data sampling can rarely support e.g. Hessian data (or even adequate guesses for them).
Our arguments are based on the use of baricentic coordinates associated with triangles instead of the usual Cartesian ones. Applying Remark 3.2 to the difference of the first order solution given in Theorem 2.3 a way is opened to develop a new geometric approach to the system of Zlámal-Ženišek equations and its alternative variants which may have further independent theoretical and educational interest.
2. Main results
Recall that given a non-degenerate triangle with , the normalized baricentric coordinates of a point are the terms of the necessarily unique triple \big{[}\lambda_{{\bf T}}^{{\bf a}}({\bf x}),\lambda_{{\bf T}}^{{\bf b}}({\bf x}),\lambda_{{\bf T}}^{{\bf c}}({\bf x})\big{]}\in\mathbb{R}^{3} such that
[TABLE]
We reserve the symbols as standard notation. It is well-known from elementary analytic plain geomertry [2] that
[TABLE]
thus normalized baricentric coordinates can easily be calculated by means of determinants or inner products with a -rotation:
[TABLE]
For later use we also introduce the abbreviating notations
[TABLE]
As for geometric interpretation, resp. are the affine coordinates of the point with respect to the orthogonal frame \big{[}{\bf a,p,a\!+\!(p\!-\!a)R}\big{]} with origin so that .
*Theorem 2.3. There is a unique local linear polynomial -spline procedure acting on triagular meshes with the property of uniform shape on verticesThat is satisfying Postulates A,B with f_{{\cal T},F}\in{\cal C}^{1}\big{(}{\rm Dom}({\cal T})\big{)}. and having shape functions with minimal computational complexity. Its shape functions are
[TABLE]
The corresponding basic functions for a non-degenerate triangle with distinguished vertex have the form
[TABLE]
**Theorem 2.4. **A spline procedure acting on triangular meshes and satisfying Postulates A,B produces -smooth splines if and only if its shape functions are of the form
[TABLE]
*and the basic functions *for a non-degenerate triangle with distinguished vertex can be written in terms of the modified shape function
[TABLE]
*and the rotation matrix in as
[TABLE]
where
[TABLE]
with the following free options in resp. :
- (i)
* are arbitrary polynomial functions,*
- (ii)
* are arbitrary maps assigning polynomial functions to pairs of distinct points,*
- (iii)
* are arbitrary maps assigning polynomial functions to triples of non-collinear points with the symmetry .*
**Remark 2.7. **(i) Actually, Theorem 2.3 is simply a corollary of Theorem 2.4 by setting the options to [math]. We emphasize it for its potential practical and educational use.
(ii) The formally rational expressions in are polynomials. Indeed, \Phi^{\prime}(1-t)/\big{[}t^{2}(1-t)^{2}\big{]}=30-3(1-2t)\Phi_{1}(1-t)+t(1-t)\Phi_{1}^{\prime}(1-t), resp. .
(iii) are the affine functions determined by the properties {\rm Line}\{\!{\bf a,\!b}\!\}\!\!=\!\!\big{(}\lambda_{\bf T}^{\bf p}\!\!=\!\!0\big{)}, {\rm Line}\{\!{\bf b,\!p}\!\}\!\!=\!\!\big{(}\lambda_{\bf T}^{\bf a}\!\!=\!\!0\big{)}, {\rm Line}\{\!{\bf a,\!p}\!\}\!\!=\!\!\big{(}\lambda_{\bf T}^{\bf b}\!\!=\!\!0\big{)}, . For the parametrized edge points in we have
On the other hand resp. . Hence, with the formulas , the shape conditions hold automatically with and resp. , furthermore also is fulfilled.
(iv) One can check with symbolic computer algebra that all the spline procedures described in Theorem 2.4 produce -functions. It suffices to establish only that, given any two adjacent non-degenerate triangles resp. with common edge and distinguished point , the gradient vectors of the basic functions coincide with those of at the points . Indeed, hence it follows that the unit spline functions \big{(}{\bf p}\!\in\!{\rm Vert}({\cal T}),\,i\!=\!0,1,2\big{)} corresponding to the gradient data F^{0}_{\bf p}:=\big{\{}[{\bf p},1,{\bf 0}],[{\bf q},0,{\bf 0}]:{\bf q}\in{\rm Vert}({\cal T})\setminus\{{\bf p}\}\big{\}} resp. F^{j}_{\bf p}:=\big{\{}[{\bf p},0,{\bf e}^{[j]}],[{\bf q},0,{\bf 0}]:{\bf q}\in{\rm Vert}({\cal T})\setminus\{{\bf p}\}\big{\}} are continuously differentiable.
**Theorem 2.8. **A -spline procedure S described in Theorem 2.4 in the form is isometry-invariant if and only if for all and furthermore the higher terms in transform as resp. \big{[}R^{1,{\bf G\!(p)}}_{\bf G\!(a),G\!(b)},R^{2,{\bf G\!(p)}}_{\bf G\!(a),G\!(b)}\big{]}=\big{[}R^{1,{\bf p}}_{\bf a,b},R^{2,{\bf p}}_{\bf a,b}\big{]}{\bf A} whenever is an isometry.
3. Proof of Theorem 2.4**
Henceforth we consider an arbitrarily fixed procedure which satisfies Postulates A,B and produces continuous but not necessarily continuously differentiable functions. We reserve the notations , resp. for the basic functions resp. shape functions as established in Section 1. In accordance with we can write
[TABLE]
and with suitable polynomials .
Next we are going to express the constraints , on the basic functions in terms of and baricentric coordinates. To this aim, we recall the following folklore fact from elementary algebraic geometry relating the root curves with a product decomposition of multivariate polynomials which is an easy consequence of Bézout’s Theorem [3,4].
Remark 3.2(i) If are distinct straight lines such that {\bf L}_{k}=\big{(}\ell_{k}=0\big{)} with the affine functions (i.e. polynomials of first degree) then a polynomial is divisable with if and only if, for any index , it vanishes in order at the points of . In particular, given a non-degenerate triangle , a polynomial of two variables has the form
[TABLE]
for some polynomial if and only if it vanishes in order at the points of , order at and order at , respectively.††† vanishes in order at the point if whenever .
(ii) If is a polynomial of two variables, we can write
[TABLE]
are well-defined polynomials in one resp. two variables. We shall call the -polynomial of first degree the principal part of .
Lemma 3.4. The basic functions for have the form
[TABLE]
in terms of the baricentric coordinates , the shape functions , and with suitable polynomials of two variables.
**Proof. **Fix any triangle . As mentioned, necessarily holds and is a polynomial. Consider the functions
[TABLE]
Along the edge , at the points we have , , . Observe that the functions suit the shape uniformity conditions because
[TABLE]
and since are polynomial multiples of . Also, since , and
[TABLE]
Therefore the difference functions and vanish on the edge of the triangle . Similar arguments with the points show that and vanish on . By their gradients also vanish on the edge {\rm Co}\{{\bf a,b}\}=\big{(}\lambda_{\bf T}^{\bf p}=0\big{)}. Hence (cf. Remark 3.2) they are polynomial multiples of , say and , respectively. Since are linearly independent affine functionals, the mapping \Lambda^{\bf p}_{\bf a,b}:{\bf x}\mapsto\big{[}\lambda^{\bf b}_{\bf T}({\bf x}),\lambda^{\bf a}_{\bf T}({\bf x})\big{]} is an affine coordinatization on the plain . Thus we can express each term as a polynomial of the coordinates which completes the proof.
**Notation 3.5. **For later convenience, without danger of confusion, we introduce the unifying context-free notations
[TABLE]
Furthermore, in view of Lemma 3.4, we shall write
[TABLE]
where
[TABLE]
and the terms are polynomials with coefficients depending on the ordered tuple . Notice that necessarily
[TABLE]
due to the trivial index symmetries and .
Lemma 3.8. We have f_{{\cal T},F}\in{\cal C}^{1}\big{(}{\rm Dom}({\cal T})\big{)} for every triangular mesh with arbitrary gradient data if and only if
[TABLE]
Proof.* *Given any non-degenerate triangle , By construction, for the points , and on the edges of the triangle we have independently of , independently of and independently of . Thus the shape conditions are automatic from . Moreover, given any triangle with a common edge but disjoint interior to , the functions pairs resp. touch continuosly. The analogous necessary and sufficent condition for a -smooth touching is that the gradient pairs resp. coincide on the common edge:
[TABLE]
Observe that (3.10(i)) holds automatically with the trivial value . Furthermore conditions (3.10(i)) and (3.10(ii)) are equivalent (by changing the roles of and ). Finally we observe that, in (3.iiipxiii(i)), for fixed and we can choose the points and on different half plain components of arbitrarily. This implies that all the vectors , with must be the same. Due to the construction (1.3), the fact that all the pairs resp. of basic functions touch -smoothly in case of adjacent triangles , ensures that the splines are all -smooth as well.
Notation 3.11. Given any ordered triple of non-collinear points, we shall write for the constant gradient vectors of the baricentric coordinate functions. Notice that, by ,
[TABLE]
where according as are oriented anticlockwise or clockwise. In particular, if is a non-degenerate triangle, we have
[TABLE]
Lemma 3.13. If is a non-degenerate triangle, at the points of the edge we have
[TABLE]
Proof.* *With the abbreviations
[TABLE]
we can write
[TABLE]
We complete the proof with the observations that
[TABLE]
Remark 3.15. To prove Theorem 2.4, we need a precise description for the coefficients of the polynomials in terms of the variables such that should hold.
According to Lemma 3.8, the procedure produces -splines for every admissible data if and only if, for any and for any fixed pair of distinct points, the gradient expressions are independent of the variable ranging in . This latter condition can be formulated in terms of the -independent affine coordinates as follows. By we have
[TABLE]
Thus we can rewrite in the form
[TABLE]
Hence we conclude immediately the following.
Lemma 3.17. We have if and only if for every pair of distinct points there exist polynomials of one variable such that
[TABLE]
independently of the choice of outside .
We can regard as a partial algebraic condition on the polynomials of two variables as
[TABLE]
Since, for fixed , the coordinates \big{(}\xi^{\ {\bf b}}_{\bf p,a},\overline{\xi}^{\ {\bf b}}_{\bf p,a}\big{)} may assume arbitrary values with , from we obtain the polynomial divisability relations t^{2}(1-t)\big{|}K^{i,{\bf p}}_{\bf a}(t) and t^{2}(1-t)\big{|}x^{[i]}\big{(}(1\!-\!t)({\bf a\!-\!p})\big{)}[\Phi^{[i]}]^{\prime}\!(t). Since x^{[0]}\big{(}(1-t){\bf(a-p)}\big{)}\equiv 1 and x^{[0]}\big{(}(1-t){\bf(a-p)}\big{)}\equiv(1-t)x^{[j]}({\bf a-p}) for , with the aid of we can state in the form
[TABLE]
with suitable polynomials and of one variable. Actually
[TABLE]
for on the basis of In terms of the Kronecker-, we can write even
[TABLE]
Clearly, the polynomials cannot be chosen arbitrarily. There is a unique obstacle: we obtained Lemma 3.13 and hence by an inspection of on one of the edges of a triangle at the distinguished point (namely with the parametrization ) while also the analogous conclusion should also be taken simultaneously in to account with the second edge (namely issued from . Applying a change and taking into account the symmetry , we see that also
[TABLE]
We obtain the complete description for the families of polynomials being admissible by Lemma 3.17 by the next obervation.
Lemma 3.22. For any pair , in we have .
Proof*. *Fix and arbitrarily. Consider for pairs with written in the form
[TABLE]
Due to , with the abbreviations and we get
[TABLE]
Since , in any case we have . It follows
[TABLE]
Suppose indirectly for some . Let and choose such that whenever . Then we have that is \beta(\tau\pm\delta/2)\in\big{[}-\varepsilon/4,\varepsilon/4]-\beta(\tau). Therefore \beta(\tau+\delta/2)+\beta(\tau-\delta/2)\in\big{[}-\varepsilon/2,\varepsilon/2\big{]}-2\beta(\tau)\subset\big{[}-\varepsilon/2,\varepsilon/2\big{]}+\{-2\varepsilon,2\varepsilon\}=\big{[}-5\varepsilon/2,-3\varepsilon/2\big{]}\cup\big{[}3\varepsilon/2,5\varepsilon/2\big{]} i.e. |\beta(\tau+\delta/2)+\beta(\tau-\delta/2)|\in\big{[}3\varepsilon/2,5\varepsilon/2\big{]} However, we also have which leads to the contradiction |\beta(\tau+\delta/2)+\beta(\tau-\delta/2)|\in\big{[}3\varepsilon/2,5\varepsilon/2\big{]}\cap\big{[}0,\varepsilon/4\big{]}=\emptyset. By the arbitrariness of the radius , the angle and the origin , we conclude that in any case.
For we get i.e. immediately by plugging with in the first equation of . . (Remark: , thus the argument does not work for ). In the case we conclude as follows. Consider the difference of equations for with and . Since is estabished already, we get simply which completes the proof.
Corollary 3.24. The relations hold if and only if we have with the symmetry where the polynomials respectively x^{[i]}\big{(}(1\!-\!t){\bf(a-p)}\big{)}[\Phi^{[i]}]^{\prime}(t) are all divisable by .
Proof.* *The relation implies that there is a polynomial such that and with some polynomial. Similarly, from we conclude that and with some polynomial .
Corollary 3.25. We can write and the admissible shape functions have the form
[TABLE]
with suitable polynomials .
Proof.* *The stated form of is clear from . By definition and x^{[0]}\big{(}(1-t){\bf(a-p)}\big{)}\equiv 1. Furthermore and x^{[j]}\big{(}(1\!-\!t){\bf(a\!-\!p)}\big{)}\!=\!(1\!-\!t)x^{[j]}_{\bf p}({\bf a}) for . Thus, taking into acount, the relation that is a divisor of x^{[0]}\big{(}(1\!-\!t){\bf(a\!-\!p)}\big{)}[\Phi^{[0]}]^{\prime}(t)\!=\!\Phi^{\prime}(t)\!=\!6t(1\!-\!t)+2t(1\!-\!t)(1\!-\!2t)\Phi_{0}(t)+t^{2}(1\!-\!t)^{2}\Phi^{\prime}_{0}(t) means simply that t(1\!-\!t)\big{|}6+2(1\!-\!2t)\Phi_{0}(t) i.e. implying , . Therefore with a polynomial and the generic form of is \big{(}3.1{\rm(i)}\big{)}. Also according to in the cases we can write with some polynomial . Thus the relation that is a divisor of x^{[j]}\big{(}(1-t){\bf(a-p)}\big{)}[\Phi^{[0]}]^{\prime}(t)\equiv(1-t)x^{[j]}_{\bf p}({\bf a})\big{[}\Psi(t)/(1-t)\big{]}^{\prime} means that t^{2}(1-t)\big{|}\big{[}\Psi(t)/(1-t)\big{]}^{\prime}\equiv-2t+t(2-3t)\Psi_{0}(t)+t^{2}(1-t)^{2}\Psi_{0}^{\prime}(t) is equivalent to saying t(1-t)\big{|}-2+(2-3t)\Psi_{0}(t) i.e. implying and . Therefore with some polynomial and the generic form of is \big{(}3.26{\rm(i)}\big{)}.
3.27. Finish of the proof of Theorem 2.4
In view of and Remark 3.2(ii) we can write
[TABLE]
with suitable polynomials of one- resp. two variables such that t^{2}(1\!-\!t)^{2}\big{|}K^{i,{\bf p}}_{\bf c}(t) and t^{2}(1\!-\!t)\big{|}x^{[i]}_{\bf p}({\bf a})[\Phi^{[i]}]^{\prime}(t). It is straightforward to check that the functions are polynomials in these cases and if and only if . It remains to show that the expressions
[TABLE]
are independent of the term whenever
[TABLE]
with arbitrary polynomials and the polynomials have the form with arbitrarily fixed polynomials of one variable.
Repeating the calculations of Lemma 3.13, we see that holds independently of the choice of . Notice that we have constructed the polynomials in terms of in a manner such that should be fulfilled. Thus the expression \big{[}\overline{\xi}^{\ {\bf b}}_{\bf p,a}\big{]}^{-1}\!\left[x^{[i]}\big{(}(1\!-\!t)({\bf a\!-\!p})\big{)}[\Phi^{[i]}]^{\prime}\!(t)\xi^{\bf b}_{\bf p,a}+t^{2}(1\!-t)P^{i,{\bf p}}_{\bf a,b}(0,1\!-t)\right]\big{(}\!=\!K^{i,{\bf p}}_{\bf a}(t)\big{)} is independent of automatically which completes the proof in view of Lemma 3.17.
4. Invariance
Lemma 4.1. Let be an invertible affine map . A spline procedure satisfying Postulate A is -invariant if and only if holds for any non-degenerate triangle with distinguished vertex .
Proof.* *The -invariance of S means that, given any triangular mesh , the unit functions \big{(}i\!=\!0,\!1,\!2;\ {\bf p}\!\in\!{\rm Vert}({\cal T})\big{)} corresponding to the gradient data F_{i,{\bf p}}:=\big{\{}({\bf p},1,{\bf 0}) if , for i\!=\!1\!,2\big{\}}\cup\big{\{}({\bf q},0,{\bf 0}):{\bf p}\!\neq\!{\bf q}\!\in\!{\rm Vert}({\cal T})\big{\}} are transformed by as
[TABLE]
with the gradient data of the transformed function on the transformed vertices. Consider any triangle . Notice that the basic functions over are given as restrictions of the unit functions. In particular and . On the other hand, by Postulate A, for any gradient data on {\rm Vert}\big{(}{\bf G}({\cal T})\big{)} of the transformed mesh, such that \big{(}{\bf G(p)},\omega,[\alpha,\beta]\big{)},\big{(}{\bf G(a)},0,{\bf 0}\big{)},\big{(}{\bf G(b)},0,{\bf 0}\big{)}\in G, we have . We can apply this observation to with to conclude that
[TABLE]
Hence the matrix form in is immediate: implies that and .
Corollary 4.4. There is no affine invariant -spline procedure. satisfying Postulate A.
Proof.* *Proceed by contradiction. Assume the procedure with basic functions is affine invariant. Then, in particular, holds for all transformations with and . Consider the triangles
[TABLE]
Then, according to , for the points with we have
[TABLE]
Since , in we can write \nabla[\psi^{(j)}_{{\bf 0},{\bf T}}\circ{\bf G}_{\bf b}^{-1}]({\bf y})=\big{[}\nabla\psi^{(j)}_{{\bf 0},{\bf T}}({\bf yA}_{\bf b}^{-1})\big{]}[{\bf A}_{\bf b}^{\rm T}]^{-1}. Therefore, for any and with ,
[TABLE]
Observe that the segment is a common edge of all the triangles . Hence, in view of Remark 3.15, the gradients with must be independent of for any fixed . Since , our indirect assumption leads to the conclusions that and \big{[}\nabla\psi^{(2)}_{{\bf 0},{\bf T}_{\bf b}}({\bf y}_{t})\big{]}{\bf A}_{\bf b}^{\rm T}=\nabla\psi^{(2)}_{{\bf 0},{\bf T}}({\bf y}_{t}) for all and with . This latter identity means in particular that which is possible with -independent only if . However, hence we get which contradicts the defining relations with .
Lemma 4.6. (Reflection lemma). Let be a non-degenarate triangle of the form and assume S is a spline procedure satisfying Postulate A. Then, for the fixed points of the reflection , {\bf U}=\big{[}\genfrac{}{}{0.0pt}{}{1\ \ \ 0}{0\ -1}\big{]} through the -axis we have
[TABLE]
Proof.* *The triangles and are adjacent, the segment is their common edge. According to Remark 3.15, the pairs resp. of basic functions must be coupled -smoothly along it: , resp. , for all . On the other hand, the transformation rules require resp. \big{[}\psi^{(1)}_{\bf 0,K(T)},\psi^{(2)}_{\bf 0,K(T)}\big{]}\!=\!\big{[}\psi^{(1)}_{\bf 0,T}\circ{\bf K}^{-1},\psi^{(2)}_{\bf 0,T}\circ{\bf K}^{-1}\big{]}{\bf U} i.e. and for all . By passing to gradients, since and , we get and for the points . In particular on the common edge of with we must have i.e. implying 0=\frac{\partial}{\partial y}\varphi_{\bf 0,T}({\bf u}_{t})=\big{\langle}\nabla\varphi_{\bf 0,T}({\bf u}_{t})\big{|}{\bf e}^{[2]}\big{\rangle}. Similarly we conclude that implying and implying in particular .
Proposition 4.7. Homothetically invariant -spline procedures satisfying Postulate A are shape uniform on edges i.e. they satisfy Postulate B automatically.
Proof.* *Let and define
[TABLE]
Cosider any other non-degenerate triangle . Due to the arbitrariness of the choice of , it suffices to see only that, for and ,
[TABLE]
It is a crucial fact that we can find a homothetic transformation
[TABLE]
Actually {\bf A}=\big{[}\genfrac{}{}{0.0pt}{}{x({\bf a-p})\ \ \ y({\bf a-p})}{-\sigma y({\bf a-p})\ \sigma x({\bf a-p})}\big{]} where if the points are oriented clockwise and else. According to , . Since is a common edge of and , in view of Remark 3.15 we have
[TABLE]
which proves the first part of . To prove , consider also the symmetry
[TABLE]
of the triangle . By we have \big{[}\psi^{(1)}_{\bf 0,T},\psi^{(2)}_{\bf 0,T}\big{]}\!=\!\!\big{[}\psi^{(1)}_{\bf 0,T}\circ{\bf H},\psi^{(2)}_{\bf 0,T}\circ{\bf H}\big{]}{\bf S} whence
[TABLE]
Thus while . On the other hand, by Lemma 4.ivpvii, . Finally we apply Remark 3.15 and to the points of the common edge between the triangles and . Hence we conclude that
[TABLE]
Thus which completes the proof.
4.12. Proof of Therem 2.8
It is clear that the coordinate values are homothetic invariant i.e. whenever the transformation is of the form with a constant and an orthogonal -matrix . The baricentric coordinates are even affine invariant as it is well-known from classical Projective Geometry. Hence it suffices to see that the invariance relations
[TABLE]
imply that whenever is a non-degenerate triangle and is the orthogonal reflection through i.e.
[TABLE]
so that where . Let us first investigate the relation . By pluging
[TABLE]
in the expressions of resp. formed with , since and resp. , we get
[TABLE]
Comparing the coefficients of the monomials , in view of we see that
[TABLE]
Since and , from (i) we conclude that . On the other hand, (iii) implies the isometry invariance of the non-principal parts because the lines can be chosen arbitrarily and hence the corresponding reflections generate the whole group of self-isometries of .
The treatment of the relations
[TABLE]
is analogous by using the vectorial forms \bm{\psi}_{\bf q,W}:=\big{[}\psi^{(1)}_{\bf q,W},\psi^{(2)}_{\bf q,W}\big{]} for triangles with distinguished vertex . With this formalism the above invariance relation can be written as \bm{\psi}_{\bf G\!(p),G\!(T)}({\bf x})=\big{[}\bm{\psi}_{\bf p,T}\big{(}{\bf G}^{-1}({\bf x})\big{)}\big{]}{\bf S} where , and
[TABLE]
with the vector valued polynomials
[TABLE]
for where {\bf R}^{{\bf p}}_{\bf a,w}:=\big{[}{\bf R}^{1,{\bf p}}_{\bf a,w},{\bf R}^{2,{\bf p}}_{\bf a,w}\big{]} and {\bf k}_{\bf u}^{{\bf p}}:=\big{[}{\bf k}_{\bf w}^{1,{\bf p}},{\bf k}_{\bf w}^{2,{\bf p}}\big{]}. Clearly {\bf(G\!(x)\!-\!p)S}\!=\!{\bf(G\!(x)\!-\!G\!(p))S}\!=\!{\bf\big{(}(a+(x\!-\!a)S)\!-\!(a+(p\!-\!a)S)\big{)}S}\!=\!{\bf(x\!-\!p)S^{2}}={\bf x\!-\!p}. Hence the comparison of the coefficients of the monomials yields
[TABLE]
Considering again , since and since resp. , we conclude .
Acknowledgement. This research was supported by the Ministry of Human Capacities, Hungary grant 20391-3/2018/FEKUSTRAT.
REFERENCES
- [1
] R.E. Barnhill, Smooth interpolation over triangles (p.47) 45-70?, in: R.E. Barnhild and R.F. Riesenfeld (Ed.-s), Computer Aided Geometric Design, Academic Press, NY-San Francisco-London,1974.
- [2
] H-S.M. Coxeter, Introduction to Geometry, New York: Wiley, 1969.
- [3
] William Fulton, Algebraic Curves, Mathematics Lecture Note Series. W.A. Benjamin. p. 112. (1974).
- [4
] H. Hamilton, Plane Algebraic Curves, Calderon Press, Oxford, 1920.
- [5
] Lorentz, Hermite interpolation by algebraic polynomials: A survey in Numerical Analysis 2000 (Elsevier).
- [6
] Meng wu, Bernard Mourrain, Andr Galligo, B. Nkonga, Hermite Type Spline Spaces over Rectangular Meshes with Complex Topological Structures, Communications in Computational Physics 21/3, 835-866.
- [7
] L.L. Schumacher, Spline Functions, Computational Methods, SIAM 2015.
- [8
] I.V. Sergienko, O.M. Lytvyn, O.O. Lytvyn and O.I. Denisova, Explicit formulas for interpolating splines of degree 5 on the triangle, Cybernetics and Systems Analysis, Vol. 50, No.5 (2014), 670-678.
- [9
] M. Zlámal and A. Ženišek, Mathematical aspects of the FEM, in Technical Physical and Mathematical Priciples of the FEM, Ed.-s V. Kolaž et al., Akademia, Praha, 1971, pp. 15-39.
L.L. STACHÓ
Bolyai Institute,
Interdisciplinary Excellence Centre,
University of Szeged
