Academic
Publications
Solving Bezout-like polynomial equations for the design of interpolatory subdivision schemes

Solving Bezout-like polynomial equations for the design of interpolatory subdivision schemes,10.1145/1837934.1837983,Costanza Conti,Luca Gemignani,Luc

Solving Bezout-like polynomial equations for the design of interpolatory subdivision schemes   (Citations: 1)
BibTex | RIS | RefWorks Download
Subdivision schemes are nowadays customary in curve and surface modeling. In this paper the problem of designing interpolatory subdivision schemes is considered. The idea is to modify a given approximating subdivision scheme just enough to satisfy the interpolation requirement. From an algebraic point of view this leads to the solution of a generalized Bezout polynomial equation possibly involving more than two polynomials. By exploiting the matrix counterpart of this equation it is shown that small-degree solutions can be generally found by inverting an associated structured matrix of Toeplitz-like form. If the approximating scheme is defined in terms of a free parameter, then the inversion can be performed by numeric-symbolic methods.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ... order of the interpolatory scheme we construct is higher than the approximation order of the given noninterpolatory scheme (see [13] for more details on this matter and Fig. 1 for a numerical comparison of the limit curves obtained by the schemes presented in Section 5). Yet, in case of non binary schemes, due to the proposed construction the increment of the support size of the interpolatory masks is less significant as shown in [8]...

    Costanza Contiet al. From approximating to interpolatory non-stationary subdivision schemes...

Sort by: