Estimating error bounds for quaternary subdivision schemes (Q1029139): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jmaa.2009.04.050 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025656706 / rank
 
Normal rank

Revision as of 22:54, 19 March 2024

scientific article
Language Label Description Also known as
English
Estimating error bounds for quaternary subdivision schemes
scientific article

    Statements

    Estimating error bounds for quaternary subdivision schemes (English)
    0 references
    0 references
    0 references
    9 July 2009
    0 references
    It is observed that in quaternary subdivision schemes each edge of control polygon is divided into four sub-edges, therefore it is not feasible to evaluate error bounds of quaternary curve schemes by following the corresponding results of \textit{G. Mustafa} [J. Comput. Appl. Math. 193, 596--613 (2006; Zbl 1120.65018) and J. Comput. Math. 25, No.~4, 473--484 (2007; Zbl 1141.65341)]. Error bounds for quaternary subdivision curves and surfaces are presented. As future work the authors propose to extend the result to the case of \(n\)-ary subdivision schemes.
    0 references
    0 references
    0 references
    Subdivision surfaces
    0 references
    control polygon
    0 references
    error bound
    0 references
    subdivision depth
    0 references
    forward differences
    0 references
    quaternary curve schemes
    0 references
    0 references