8. Complete Polynomial RSD Solutions
Henceforth, until the end of the section, we assume that the terms in
are polynomials. In particular we shall be interested in the extreme RSD tuples
in (26) with the shape functions (27). Notice that
We shall apply the following elementary facts from the theory of Euclidean resp. prime ideal rings [1] restricted to the setting of real polynomials:
-
F1.
If are polynomial functions such that and then .
-
F2.
If are polynomial functions then there exist polynomials (the so-called cofactors of r wrt. ) such that if and only if i.e., the greatest common divisor of is a divisor of r.
Remark 7. The computer algebra packages MAPLE resp. WolframMathematica contain commands providing a cofactor representation with the degree limitation . According to the reference in the packages, the construction of goes back to an early work [1] of Bézout, relying on a careful inspection of the steps of Euclidean division, restricted to the case of two polynomials. It seems, there is no analogous command for more polynomials. Our later discussion requires to calculate the GCD of three terms. Clearly we can produce a cofactor representation of the form by calculating consecutively the cofactors of and then the cofactors of with the standard routines we get a representation with , . Unfortunately, the degree limitation is no longer valid generally. (One can find several counter-examples of the form , , with random coefficients). Nevertheless we can prove the following sharpened version of F1 suited for reducing remarkably the numerical costs involving algorithms with GCD of several polynomials.
-
F2*.
Given any family of real polynomials (or even polynomials with coefficients in a generic field), we can choose with such that .
Since we do not know any reference, we include an Appendix with constructive proof which gives rise to a related algorithm in a straightforward manner.
Lemma 3. Let be a double edge being the intersection of the mesh triangles and . Assume are polynomial maps and the lateral derivatives in are polynomial functions. Then the determinant equation admits a polynomial solution whenever .
Proof. Omitting the indices m without danger of confusion, let us write for the components of the polynomial vector function and let . Assume that for some polynomial .
Observe that due to hypothesis
on the vectors
, we have
Proof by contradiction: The relation would imply whence . This is impossible since, by supposing , we would have for some scalar which would mean that the intersection of the triangles would be a nondegenerate triangle. We conclude by arguing with the index change .
Consider the case
i.e.,
for some polynomial
. On the other hand, since
, we can write
with the polynomial function with components
. By
, we have
and hence we get the identity
According to
F1, we see that necessarily
that is
. According to
F2, there are polynomials
such that
which completes the proof. □
As an immediate corollary, we find the following polynomial solution of the G1-Interpolation Problem.
Theorem 2.
Given any polynomial RSD tuple Π, in particular or , the map in Theorem 1 applied with polynomial edge corrections such that
is a parametrized G1-spline surface passing through the mesh points with the lateral derivatives along mesh edges, which consists of polynomial submaps .
Algorithm 1. Representation of with a polynomial RSD tuple
Require: for the number of mesh vertices, triangles resp. double edges;
the index functions of the mesh structure in (3), (4), (5), (6), (7);
for mesh vertices, data values resp. data vectors in ;
polynomial RSD shape functions , .
Ensure: List of functions representing subfunctions
in the form
in terms of the local barycentric parametrization in (29) of triangle .
Calculation: With auxiliary storages
for polynomial maps ;
for polynomial functions.
STEP 1: Compute and store the basic approximations
,
Substitutions in each ;
STEP 2: For , compute and save the edge correction functions
.
STEP 3: Using Algorithm 2, compute and save the GCD cofactors of the
components of
.
OUTPUT1: The subfunctions in storages in terms of extended weights
computed consecutively along the double edges
with corrections corresponding to
in Lemma 2:
;
,
;
OUTPUT2: The subfunctions in storages in terms of local weights
with substitution .