Next Article in Journal
Rings of Multisets and Integer Multinumbers
Next Article in Special Issue
On a New Family of Runge–Kutta–Nyström Pairs of Orders 6(4)
Previous Article in Journal
Infinite–Dimensional Bifurcations in Spatially Distributed Delay Logistic Equation
Previous Article in Special Issue
Runge-Kutta-Nyström Pairs of Orders 8(6) with Coefficients Trained to Perform Best on Classical Orbits
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Simple Affine-Invariant Spline Interpolation over Triangular Meshes

by
László L. Stachó
Bolyai Institute, University of Szeged, Aradi Vértanúk tere 1, 6725 Szeged, Hungary
Mathematics 2022, 10(5), 776; https://doi.org/10.3390/math10050776
Submission received: 21 January 2022 / Revised: 18 February 2022 / Accepted: 23 February 2022 / Published: 28 February 2022
(This article belongs to the Special Issue Numerical Analysis and Scientific Computing II)

Abstract

:
Given a triangular mesh, we obtain an orthogonality-free analogue of the classical local Zlámal–Ženišek spline procedure with simple explicit affine-invariant formulas in terms of the normalized barycentric coordinates of the mesh triangles. Our input involves first-order data at mesh points, and instead of adjusting normal derivatives at the side middle points, we constructed the elementary splines by adjusting the Fréchet derivatives at three given directions along the edges with the result of bivariate polynomials of degree five. By replacing the real line R with a generic field K , our results admit a natural interpretation with possible independent interest, and the proofs are short enough for graduate courses.

1. Introduction

With the rapid increase in computing capacity, spline interpolation over triangular meshes became a popular issue in numerical mathematics: given the data of the coordinates of points from some 2D surface, triangularization techniques and then C 1 -spline constructions are widely used for approximating the underlying surface with high accuracy. The related literature with large computational demands and a spectacular outcome is enormous. Beautiful examples relatively close to our context are Hahman (2000) [1] and Cao (2019) [2] and the references therein.
Our aim in this short note is somewhat in the opposite direction. We investigate “minimalist” approaches: given a triangular mesh on the plane, find a method producing a C 1 -spline with polynomials of low degree on the mesh triangles, which is “local” in the sense that the coefficients for any mesh triangle can be calculated with an explicit formula depending only on the location and the given data (as function values, differential requirements, etc.) associated with the vertices of two adjacent triangles. Our presented results originate from computer algebraic studies of the classical method by Zlámal et al. (1971) [3] based on the fact that the requirement of adjusting fifth-degree polynomials for function, gradient, and Hessian values along with normal derivatives at edge middle points of a single mesh triangle gives rise to a C 1 -spline. Originally, they only proved that the linear system of 21 equations for calculating the 21 coefficients for the adjustment admits a unique solution. Recently, Sergienko et al. (2014) [4] published the rather sophisticated related explicit formulas, which motivated us to develop an axiomatic approach to locally generated polynomial spline methods Stachó (2019) [5] The recent work is a non-straightforward application of the results there, although it is self-contained formally. We only used the principal shape functions Φ and Θ below provided by Theorem 2.3 in Stachó (2019) [5] in the simplest form without the need for any hint of their provenience.
We describe a family of local C 1 -spline procedures with really simple explicit affine-invariant five-degree polynomials in terms of barycentric coordinates by adjusting first-order data at the vertices. Though the result seems to be a variant of the procedure by Zlámal–Ženišek (ZZ), it cannot be deduced as a special case as it is free of the concept of orthogonality. The proof, which may have independent interest, is basically different from that of ZZ.

2. Main Results

Throughout this work, let:
Φ ( t ) : = t 3 ( 10 15 t + 6 t 2 ) , Θ ( t ) : = t 3 ( 4 3 t ) .
Fix also any non-degenerate triangle T with vertices p 1 , p 2 , p 3 on the plane R 2 along with three affine functions x f i + A i ( x p i ) (that is, f i R , A i L ( R 2 , R ) ) , and define:
F 0 ( x ) : = i = 1 3 Φ λ i ( x ) f i + Θ λ i ( x ) A i ( x p i )
where λ 1 , λ 2 , λ 3 : R 2 R are the barycentric weights determined unambiguously by the relations:
i = 1 3 λ i ( x ) = 1 , x = i = 1 3 λ i ( x ) p i ( x R 2 ) .
Theorem 1.
Let u 1 , u 2 , u 3 R 2 be arbitrary vectors such that u k ( p j p k ) whenever { i , j , k } = { 1 , 2 , 3 } . Then, there exist constants ζ 1 , ζ 2 , ζ 3 R that can be formulated explicitly in terms of λ 1 , λ 2 , λ 3 (see (18) later) such that the function:
F ( x ) : = F 0 ( x ) + = 1 3 ζ λ ( x ) 1 m = 1 3 λ m ( x ) 2
along with its Fréchet derivatives F ( x ) v : = d d τ | τ = 0 F x + τ v behave on the edges of T for any triple ( i , j , k ) of different indices as follows:
F ( p i ) = f i , F v ( p i ) = A i v ( v R 2 ) ,
F t p i + ( 1 t ) p j = Φ ( t ) f i + [ 1 Φ ( t ) ] f j + [ ( 1 t ) Θ ( t ) A i t Θ ( 1 t ) A j ] ( p j p i ) ,
F t p i + ( 1 t ) p j u k = Θ ( t ) A i + Θ ( 1 t ) A j u k .
As a consequence, given a triangular mesh, we can obtain modifications of the celebrated Zlámal–Ženišek (ZZ) spline procedure Zlámal et al. (1971) [3], Sergienko et al. (2014) [4] regardless of second-order data, but with simple explicit scalar-product-free formulas in terms of affine functions. Notice that, due to affine invariance, our results cannot be deduced from ZZ, e.g., by setting the input second derivatives at the vertices to zero.
Recall that by a triangular mesh, we mean a family T = T 1 , T N of closed triangles in R 2 such that the intersection T m T n is either a common edge or a common vertex or empty for different indices m , n . Given any triangle T R 2 , Vert ( T ) , resp. Edge ( T ) , will denote the set of its vertices, resp. edges, and we write Vert ( T ) : = n = 1 N Vert ( T n ) , resp. Edge ( T ) : = n = 1 N Edge ( T n ) . By a dataset of first order for the mesh T , we mean a family:
F = ( p , f p , A p ) : p Vert ( T ) with f p R , A p L ( R 2 , R ) .
We call a C 1 -smooth function f : T : = n = 1 N T n R a polynomial C 1 -spline for the data F over T if the restrictions f | T n are polynomials R 2 R with Taylor expansion f p + A p ( x p ) around the points p Vert ( T n ) (i.e., f is continuously differentiable on Interior T ; furthermore, there are polynomials P 1 , , P N in two-variables with f ( [ ξ , η ] ) = P n ( ξ , η ) whenever [ ξ , η ] T n   ( n = 1 , , N ) satisfying f ( p ) = f p , P n / ξ | [ ξ , η ] = p = A p [ 1 , 0 ] , P n / η | [ ξ , η ] = p = A p [ 0 , 1 ] at the points p Vert ( T n ) ).
For our later considerations, T = { T 1 , , T N } will stand as a fixed triangular mesh. Given any mesh triangle T n , we write λ n , p p Vert ( T n ) for its barycentric weights (i.e., x = p Vert ( T n ) ( x ) p for any p R 2 ) , and E n , p denotes the edge opposite the vertex p in T n .
Theorem 2.
Let (6) be a first-order dataset for T , and let u E : E Edge ( T ) R 2 be a family of vectors with u E E . Then, we can find constants:
ζ p , E : E Edge ( T ) , p Vert ( T ) \ E for some T T R
such that the union F : T R of the polynomial functions F n : T n R obtained by replacing the terms λ ( = 1 , 2 , 3 ) in ( 1 ) , ( 2 ) with λ n , p ( p Vert ( T n ) ) as:
F n ( x ) : = p Vert ( T n ) [ Φ ( λ n , p ( x ) ) f p + Θ λ n , p ( x ) A p ( x p ) + ζ p , E n , p λ n , p ( x ) 1 q Vert ( T n ) λ n , p ( x ) 2 ]
is a polynomial C 1 -spline for the data F over T such that:
F t p + ( 1 t ) q u E = Θ ( t ) A p + Θ ( 1 t ) A q u E whenever E = [ p , q ] Vert ( T ) , 0 < t < 1 .
Remark 1.
In the course of the proof, with a straightforward adaptation of Theorem 1, we obtain an explicit expression for ζ p , E in terms of the barycentric weights of the triangle T : = Convex hull of { p } E T .

3. Preliminaries and Straightforward Observations

Our basic polynomials Φ , Θ have the Hermitian interpolation properties:
Φ ( 0 ) = Φ ( 0 ) = Φ ( 1 ) = 0 , Φ ( 1 ) = 1 , Φ ( t ) = 30 t 2 ( 1 t ) 2 ;
Θ ( 0 ) = Θ ( 0 ) = Θ ( 1 ) = 0 , Θ ( 1 ) = 1 , Θ ( t ) = 12 t 2 ( 1 t ) .
Given any indices i , j , k with { i , j , k } = { 1 , 2 , 3 } ,
λ i ( p i ) = 1 , λ i ( x ) = 0 for x [ p j , p k ] = ( 1 t ) p j + t p k : t [ 0 , 1 ] ;
λ i ( z ) v λ i ( z + p j ) = λ i ( z + p k ) = λ i z + ( 1 t ) p j + t p k independently of z , t .
Remark 2.
It is customary to express the weight λ i in terms of the natural inner product ( [ ξ 1 , ξ 2 ] | [ η 1 , η 2 ] = = 1 2 ξ η of R 2 as λ i ( x ) = x p j | m i | m i 1 m i where m i = p i r i is the height vector of the triangle T with the closest point r i to p i on the line connecting p j with p k . The formulas obtained by means of this inner product (as the explicit form of the ZZ basic functions published recently Sergienko et al. (2014) [4]) are only invariant with respect to the isometries of R 2 , while our approach is free of metric considerations and can be generalized to purely algebraic settings by replacing R with an arbitrary field K . In the sequel, we write:
G i : = v λ ( p i ) v
for the (constant) Fréchet derivative of λ i , regarded as a linear functional R R , but avoiding identifying it with the gradient vector m i | m i 1 m i .
Notice that, as it is formulated in terms of polynomials R 2 R , the functions λ 1 , λ 2 , λ 3 and F in Theorem 1 extend to to R 2 by means of the same algebraic expressions; furthermore, the identities (4) and (5) hold on the whole line t p i + ( 1 t ) p j : t R . By (9), we have λ m ( p n ) = δ m n in terms of the Kronecker symbol δ m n = 1 if m = n , 0 else ; furthermore, the monomials:
C ν 1 , ν 2 , ν 3 ( x ) = λ 1 ( x ) ν 1 λ 2 ( x ) ν 2 λ 3 ( x ) ν 3
satisfy:
C ν 1 , ν 2 , ν 3 ( x ) = 0 for x T = ( edges of T ) if min { ν 1 , ν 2 , ν 3 } 1 , C ν 1 , ν 2 , ν 3 ( x ) v = = 1 3 ν λ ( x ) 1 C ν 1 , ν 2 , ν 3 ( x ) G v .
In particular, independently of the choice of the coefficients ζ ,
F ( x ) = F 0 ( x ) for x T ,
[ = 1 3 ζ λ 1 m = 1 λ m 2 ] ( x ) v = ζ k λ i ( x ) 2 λ j ( x ) 2 G k v for x [ p i , p j ] if { i , j , k } = { 1 , 2 , 3 } .
Proof of Theorem 1.
Fix the indices i , j , k arbitrarily such that { i , j , k } = { 1 , 2 , 3 } . Consider a generic point:
x t : = t p i + ( 1 t ) p j
on the edge [ p i , p j ] of the triangle T. Since the weights λ are affine functions,
λ i x t = t , λ j x t = 1 t , λ k x t = 0 ( 0 t 1 ) .
Since Φ ( 1 t ) = 1 Φ ( t ) , in view of (15), we obtain:
F 0 x t = = i , j , k Φ λ ( x t f + Θ λ ( x t ) A x t p ] = = Φ ( t ) f i + ( 1 t ) Θ ( t ) A i ( p j p i ) + 1 Φ ( t ) f j + t Θ ( 1 t ) A j ( p i p j ) + + Φ ( 0 ) f k + Θ ( 0 ) A k t p i + ( 1 t ) p j p k .
That is, by (7) and (8),
F x t = t 3 ( 10 15 t + 6 t 2 ) f i + ( 1 t ) 3 ( 1 + 3 t + 6 t 2 ) f j + + t 3 ( 1 t ) ( 4 3 t ) A i ( p j p i ) + ( 1 t ) 3 t ( 1 + 3 t ) A j ( p i p j ) .
As for the Fréchet derivatives along the edge [ p i , p j ] , in view of (12) and (13), we obtain:
F x t v = F 0 t p i + ( 1 t ) p j v + ζ k t 2 ( 1 t ) 2 G k v .
Notice that in general, we have:
F 0 ( x ) v = = i , j , k Φ λ ( x ) [ G v ] f + Θ λ ( x ) [ G v ] A ( x p ) + Θ λ ( x ) A v .
In particular, since at the generic point (14) on [ p i , p j ] , we have x t p i = ( 1 t ) ( p j p i ) , resp. x t p j = t ( p i p j ) ,
F 0 ( x t ) v = F 0 t p i + ( 1 t ) p j v = = Φ ( t ) [ G i v ] f i + Θ ( t ) [ G i v ] ( 1 t ) A i ( p j p i ) + Θ ( t ) A i v + + Φ ( 1 t ) [ G j v ] f j + Θ ( 1 t ) [ G j v ] t A j ( p i p j ) + Θ ( 1 t ) A j v + + Φ ( 0 ) [ G k v ] f k + Θ ( 0 ) [ G k v ] A k ( x t p k ) + Θ ( 0 ) A k v .
Thus, in view of (7) and (8), it follows that:
F 0 ( x t ) v = 30 t 2 ( 1 t ) 2 [ G i v ] f i + 12 t 2 ( 1 t ) 2 [ G i v ] A i ( p j p i ) + t 3 ( 4 3 t ) A i v + + 30 t 2 ( 1 t ) 2 [ G j v ] f j + 12 t 2 ( 1 t ) 2 [ G j v ] A j ( p i p j ) + ( 1 t ) 3 ( 1 + 3 t ) A j v .
Hence, in view of (13), we conclude that:
F ( x t ) v = t 2 ( 1 t ) 2 ζ k [ G k v ] + M i , j v + t 3 ( 4 3 t ) A i v + ( 1 t ) 3 ( 1 + 3 t ) A j v where M i , j v : = 30 [ G i v ] f i + [ G j v ] f j + 12 [ G i v ] A i [ G j v ] A j ( p j p i ) .
At this point (3), (4) and (5) are immediate. Namely (3) follows from (16) and (17) by setting t : = 1 . Equation (4) is an equivalent form of (17). To verify (5), consider (17) with v : = u k . Observe that G k u k 0 since u k ( p j p i ) . Thus, the coefficient:
ζ k : = M i , j u k G k u k = 1 G k u k 30 [ G i u k ] f i + [ G j u k ] f j + 12 [ G i u k ] A i [ G j u k ] A j ( p j p i )
is well defined. Applying it, for the generic point (14) on the edge [ p i , p j ] , we obtain:
F ( x t ) u k = t 3 ( 4 3 t ) A i u k + ( 1 t ) 3 ( 1 + 3 t ) A j u k
independently of the location of the third vertex p k of the triangle T.    □
Corollary 1.
By writing v = α u k + β ( p i p j ) , we have:
F ( x t ) v = α F ( x t ) u k + β F ( x t ) ( p i p j ) = = α Φ ( t ) A i + [ 1 Φ ( t ) ] A j u k + β d d t F ( x t ) .
Proof of Theorem 2.
It suffices to verify the following two statements:
(i)
Given p Vert ( T ) and v R 2 , we have F ( p ) = f p and F ( p ) v = A p v ;
(ii)
Given two adjacent mesh triangles T m , T n T , with common edge [ p , q ] , for the points x t = t p + ( 1 t ) q on the line connecting p , q , we have F x t = F m ( x t ) = F n ( x t ) and F m ( x t ) v = F n ( x t ) v for any v R 2 .
As for (i): Choose any mesh triangle T n T with p Vert ( T n ) . By writing p 1 , p 2 , p 3 with p 1 = p for the vertices of T n , an application of (3) in Theorem 1 with F : = F n shows that F n ( p ) = F n ( p 1 ) = f p 1 = f p and F n ( p ) v = F n ( p 1 ) v = A 1 v = A p v independent of which mesh triangle T n with vertex p is considered.
As for (ii): Let T m , T n T be two adjacent triangles with common edge [ p , q ] . Necessarily, Vert ( T m ) = { p , q , r } and Vert ( T n ) = { p , q , r ¯ } with suitable mesh points r , r ¯ Vert ( T ) . An application of (4) in Theorem 1 with p 1 : = p , p 2 : = q , p 3 : = r , and F : = F m shows that:
F m ( x t ) = Φ ( t ) f 1 + [ 1 Φ ( t ) ] f 2 + Θ ( t ) A 1 + Θ ( 1 t ) A 2 ( p j p i ) = = Φ ( t ) f p + [ 1 Φ ( t ) ] f q + Θ ( t ) A p + Θ ( 1 t ) A q ( q p ) .
The same conclusion holds when replacing ( r , F m ) with ( r ¯ , F n ) . Thus, we have F m ( x t ) = F n ( x t ) along the edge [ p , q ] (moreover, along the whole straight line connecting p and q) independently of the location of the third vertices r resp. r ¯ . Since the functions F n   ( n = 1 , , N ) are R 2 R polynomials, their union F : n = 1 N T n R with F ( x ) = F n ( x ) whenever x T n is a well-defined continuous function.
From a similar application of (5) in Theorem 1 and (19) finishing its proof applied with F : = F m , p 1 : = p , p 2 : = q , p 3 : = r , u 3 : = u [ p , q ] , v : = α u 3 + β ( p 2 p 1 ) = α u [ p , q ] + β ( q p ) , and ζ 3 : = [ obtained from ( 18 ) ] we conclude that:
F m ( x t ) v = α Φ ( t ) A p + [ 1 Φ ( t ) ] A q u [ p , q ] + β d d t F m ( x t ) .
We obtain the same when the index m is replaced with n, though the values ζ 3 may differ in (18) when calculating with p 3 : = r for m and p 3 : = r ¯ for n, respectively. We know already that the functions F m , F n coincide along the common edge [ p , q ] . Therefore, with the combined function F ( F ( x ) = F n ( x ) for x T n ; 1 n N ) we indeed have F ( x t ) v = F m ( x t ) v = F n ( x t ) v = α Φ ( t ) A p + [ 1 Φ ( t ) ] A q u [ p , q ] + β d d t F ( x t ) .    □

4. Version in the Pure Algebraic Setting

We consider the possibility of replacing the real line R with an arbitrary (possibly finite) field K . Though ordering is no longer available, in particular, we cannot speak of edges [ p , q ] = { t p + ( 1 t ) q : 0 t 1 } or triangles T = { t p + s q + ( 1 s t ) r : 0 s , t , s + t 1 } in K any longer, the concept of lines  Line ( p , q ] : = t p + ( 1 t ) q : t K connecting distinct points p , q K makes sense and is widely used in algebraic geometry. From classical geometry, we can also save the concept of non-degenerate point triples  { p 1 , p 2 , p 3 } K 2 by requiring that the expression p 1 p 2 + p 2 p 3 + p 3 p 1 (which corresponds to a non-zero multiple of the area of the triangle with vertices p j in the case K = R ) should not vanish. The parallelity of two vectors u , v K 2 can also be well defined with the property u v 0 .
On the other hand, it is also well known that the formal derivation d d τ k = 0 n α k τ k : = k = 1 n k α k τ k 1 ( α 0 , , α n K ) gives rise to a calculus with multivariate polynomials with coefficients in K preserving the familiar identities as the linearity, Leibniz rule, and derivation formula of composite maps. Thus, since our computations in Algorithm 1 involve only polynomial functions, we can conclude that the following theorem holds.
Theorem 3.
Let [ p 1 , , p K ] be a sequence of distinct points in K 2 , and let [ i n , 1 , i n , 2 , i n , 3 ] : n = 1 , , N be a sequence of distinct triples of indices 1 i n , 1 < i n , 2 < i n , 3 K such that the triples:
T n : = { p i n , 1 , p i n , 2 , p i n , 3 } ( n = 1 , , N )
of points are non-degenerate. Then, given any sequence f n : n = 1 , K , constants in K along with a sequence A n : n = 1 , K of linear forms K K and any family u m , n : 1 m < n K of vectors in K 2 such that u m , n ( p m p n ) 0 ( 1 m < n K ) , the sequence [ F 1 , , F N ] of polynomial functions K K obtained with the calculations in Algorithm 1 has the following properties:
(i) 
F n ( p k ) = f k , F n ( p k ) v = A k v ( v K 2 ) whenever p k T n for some n;
(ii) 
F m | Line ( p i , p j ) = F n | Line ( p i , p j ) whenever i j and { p i , p j } = T m T n ;
(iii) 
F n t p i + ( 1 t ) p j v = Θ ( t ) A i + Θ ( 1 t ) A j u k ( t K whenever { p i , p j , p k } = T n .
Algorithm 1:. Triangular C 1 -spline with first order data
Require: K N = { 1 , 2 , } for the number of mesh points;
 List v k = [ v k x , v k y ] R 2   ( k = 1 , , K ) of mesh points;
 List f k R   ( k = 1 , , K ) for function data at mesh points;
 List A k ( ξ , η ) = A k x ξ + A k y η , A k x , A k y R   ( k = 1 , , K )
N N for the number of mesh triangles;
   of linear forms for prescribed derivatives at mesh points;
 List [ i n , 1 , i n , 2 , i n , 3 ] N 3 ( n = 1 , , N ) of indices with 1 i n , 1 < i n , 2 < i n , 3 N
   such that Vert ( T n ) = v i n , 1 , v i n , 2 , v i n , 3 ;
 List u m , n = [ u m , n x , u m , n y ] R 2 ( 0 m , n N , m n ) of vectors
   such that u m , n = u n , m ( v m v n ) ;
Ensure: List F n ( ξ , η ) ( n = 1 , , N ) of polynomials with coefficients in R .
Calculation: Consecutively, for each index n = 1 , 2 , , N , we compute the
      polynomial F n ( ξ , η ) by applying Theorem 1 and (18) as follows:
 For = 1 , 2 , 3 , let:
    p : = v i n , , f : = f i n , , A ( ξ , η ) : = A i n , ( ξ , η ) ,
    u 1 : = u i n , 2 , i n , 3 , u 2 : = u i n , 3 , i n , 1 , u 3 : = u i n , 1 , i n , 2 ;
 For technical reasons, for m = 1 , 2 , 3 , we set also
    p m + 3 : = p m , f m + 3 : = f m , A m + 3 ( ξ , η ) : = A m ( ξ , η ) , u e l l + 3 : = u m ;
 After setting the actual values for using the formulas in the theorem, for = 1 , 2 , 3 ,
   establish the barycentric weights and their derivatives as affine, resp. linear, forms,
   in terms of the outer product [ α , β ] [ γ , δ ] : = det α β γ δ = α δ β γ (see [6] Berger(1987)):
D : = p 1 p 2 + p 2 p 3 + p 3 p 1 , λ ( ξ , η ) : = [ ξ , η ] ( p + 1 p + 2 ) + p + 1 p + 2 / D , G ( ξ , η ) : = [ ξ , η ] ( p + 1 p + 2 ) / D ;
 For cyclic indexing, we set also:
    λ m + 3 ( ξ , η ) : = λ m ( ξ , η ) , G m + 3 ( ξ , η ) : = G m ( ξ , η ) ( m = 1 , 2 , 3 ) i I I .
 Then, for k = 1 , 2 , 3 , we compute the correction coefficients by means of (18):
ζ k : = 1 G k u k d = 1 2 30 [ G k + d u k ] f k + d ( 1 ) d 12 [ G k + d u k ] A k + d ( p k + 2 p k + 1 ) ;
 Finally, we let:
F n ( ξ , η ) : = = 1 3 [ Φ λ ( ξ , η ) f + Θ λ ( ξ , η ) A [ ξ , η ] p + + ζ λ ( ξ , η ) λ + 1 ( ξ , η ) 2 λ + 2 e l l ( ξ , η ) 2 ] .

5. Conclusions

Our spline interpolation described above is a ZZ-type procedure providing well-articulated explicit formulas of independent theoretical interest working even in abstract algebraic settings. From practical view points, for classical plane splines, the method is completely parallelizable, and it is clearly easy to optimize with respect to its free ζ -parameters. Applications on 3D triangular complexes even with a non-trivial topology can also be expected, though this seems to be no longer a straightforward task.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Hahmann, S.; Bonneau, G.-P. Triangular G1 interpolation by 4-splitting domain triangles. Comput. Aided Geom. Des. 2000, 17, 731–757. [Google Scholar] [CrossRef] [Green Version]
  2. Cao, J.; Chen, Z.; Wei, X.; Zhang, Y.J. A finite element framework based on bivariate simplex splines on triagle configurations. Comput. Methods Appl. Mech. Eng. 2019, 357, 112598. [Google Scholar] [CrossRef]
  3. Zlámal, M.; Zěnišek, A. Mathematical aspects of the FEM. In Technical Physical and Mathematical Priciples of the FEM; Kolaž, V., Kratoci-Ivil, F., Zlamal, M., Zenisek, A., Eds.; Publising House: Praha, Czech Republic, 1971; pp. 15–39. [Google Scholar]
  4. Sergienko, I.V.; Lytvyn, O.M.; Lytvyn, O.O.; Denisova, O.I. Explicit formulas for interpolating splines of degree 5 on the triangle. Cybern. Syst. Anal. 2014, 50, 670–678. [Google Scholar] [CrossRef]
  5. Stachó, L.L. Locally Generated Polynomial C1-Splines over Triangular Meshes. arXiv 2019, arXiv:1903.11336. [Google Scholar]
  6. Berger, M. Geometry I; Springer: Berlin, Germany, 1987. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Stachó, L.L. A Simple Affine-Invariant Spline Interpolation over Triangular Meshes. Mathematics 2022, 10, 776. https://doi.org/10.3390/math10050776

AMA Style

Stachó LL. A Simple Affine-Invariant Spline Interpolation over Triangular Meshes. Mathematics. 2022; 10(5):776. https://doi.org/10.3390/math10050776

Chicago/Turabian Style

Stachó, László L. 2022. "A Simple Affine-Invariant Spline Interpolation over Triangular Meshes" Mathematics 10, no. 5: 776. https://doi.org/10.3390/math10050776

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop