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.

Solving Bezout-like polynomial equations for the design of interpolatory subdivision schemes / Conti C; Gemignani L; Romani L. - STAMPA. - (2010), pp. 251-256. (Intervento presentato al convegno 35th International Symposium on Symbolic and Algebraic Computation (ISSAC) tenutosi a München (Germany) nel 2010) [10.1145/1837934.1837983].

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

Romani L
2010

Abstract

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.
2010
ISSAC '10, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
251
256
Solving Bezout-like polynomial equations for the design of interpolatory subdivision schemes / Conti C; Gemignani L; Romani L. - STAMPA. - (2010), pp. 251-256. (Intervento presentato al convegno 35th International Symposium on Symbolic and Algebraic Computation (ISSAC) tenutosi a München (Germany) nel 2010) [10.1145/1837934.1837983].
Conti C; Gemignani L; Romani L
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/646331
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? ND
social impact