Estimating error bounds for binary subdivision curves/surfaces (Q2493954)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5033470
Language Label Description Also known as
default for all languages
No label defined
    English
    Estimating error bounds for binary subdivision curves/surfaces
    scientific article; zbMATH DE number 5033470

      Statements

      Estimating error bounds for binary subdivision curves/surfaces (English)
      0 references
      0 references
      0 references
      0 references
      16 June 2006
      0 references
      Subdivision is an important method for generating smooth curves and surfaces due to the efficiency, flexibility and simplicity of subdivision algorithms. The error bounds for binary subdivision curves/surfaces are estimated in this paper in terms of the maximal differences of the initial control point sequence and constants depending on the subdivision mask. The result about the estimation of error bounds between binary subdivision curves and their control polygon after \(k\)-fold subdivision is applied for finding the error bounds for 4-point interpolatory, 6-point interpolatory, cubic \(B\)-spline and Chaikin's subdivision scheme. The estimation of the error bound between subdivision surfaces and their control polygons is a generalization of the main result for curves. The technique used in this paper is independent of parameterizations, of the process of subdivision and leads to bounds that can be evaluated without recursive subdivision.
      0 references
      subdivision curve
      0 references
      subdivision surface
      0 references
      subdivision depth
      0 references
      error bound
      0 references
      algorithms
      0 references
      control polygon
      0 references
      cubic B-spline
      0 references

      Identifiers