Skip to main content
SpringerLink
Log in

Using Laurent polynomial representation for the analysis of non‐uniform binary subdivision schemes

  • Published:
Advances in Computational Mathematics Aims and scope Submit manuscript

Abstract

Non‐uniform binary linear subdivision schemes, with finite masks, over uniform grids, are studied. A Laurent polynomial representation is suggested and the basic operations required for smoothness analysis are presented. As an example it is shown that the interpolatory 4‐point scheme is C 1 with an almost arbitrary non‐uniform choice of the free parameter.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A.S. Cavaretta, W. Dahmen and C.A. Micchelli, Stationary subdivision, Mem. Amer. Math. Soc. 453 (1991).

  2. I. Daubechies and J. Lagarias, Two scale difference equations I. Existence and global regularity of solutions, SIAM J. Math. Anal. 22 (1991) 1338-1410.

    MathSciNet  Google Scholar 

  3. I. Daubechies and J. Lagarias, Two scale difference equations II. Local regularity, infinite products of matrices and fractals, SIAM J. Math. Anal. 23 (1992) 1031-1079.

    Article  MATH  MathSciNet  Google Scholar 

  4. C. de Boor, Cutting corners always works, Comput. Aided Geom. Design 4 (1987) 125-131.

    Article  MATH  MathSciNet  Google Scholar 

  5. G. Deslauriers and S. Dubuc, Interpolation dyadique, in: Fractals, Dimensions Non Entieres et Applications, ed. G. Cherbit (Masson, Paris, 1989).

    Google Scholar 

  6. S. Dubuc, Interpolation through an iterative scheme, J. Math. Anal. Appl. 114 (1986) 185-204.

    Article  MATH  MathSciNet  Google Scholar 

  7. N. Dyn, Subdivision schemes in computer-aided geometric design, in: Advances in Numerical Analysis II, Wavelets, Subdivision Algorithms, and Radial Basis Functions, ed. W.A. Light (Clarendon Press, Oxford, 1992) pp. 36-104.

    Google Scholar 

  8. N. Dyn, J.A. Gregory and D. Levin, A four-point interpolatory subdivision scheme for curve design, Comput. Aided Geom. Design 4 (1987) 257-268.

    Article  MATH  MathSciNet  Google Scholar 

  9. N. Dyn, J.A. Gregory and D. Levin, Analysis of uniform binary subdivision schemes for curve design, Constr. Approx. 7 (1991) 127-147.

    Article  MATH  MathSciNet  Google Scholar 

  10. N. Dyn, J.A. Gregory and D. Levin, Piecewise uniform subdivision schemes, in: Mathematical Methods for Curves and Surfaces, eds. M. Dahlen, T. Lyche and L.L. Schumaker (Vanderbilt University Press, Nashville, TN, 1995) pp. 111-120.

    Google Scholar 

  11. N. Dyn, S. Hed and D. Levin, Subdivision schemes for surface interpolation, in: Workshop on Computational Geometry, eds. A. Conte et al. (World Scientific Publications, 1993) pp. 97-118.

  12. N. Dyn and D. Levin, Interpolating subdivision schemes for the generation of curves and surfaces, in: Multivariate Interpolation and Approximation, eds. W. Haussmann and K. Jetter (Birkhäuser, Basel, 1990) pp. 91-106.

    Google Scholar 

  13. N. Dyn and D. Levin, Analysis of asymptotically equivalent binary subdivision schemes, J. Math. Anal. Appl. 193 (1995) 594-621.

    Article  MATH  MathSciNet  Google Scholar 

  14. J.A. Gregory and R. Qu, Non-uniform corner cutting, Brunel University reprint (1988).

  15. S. Hed, Analysis of subdivision schemes for surfaces, M.Sc. Thesis, Tel Aviv University (1992).

  16. C.A. Micchelli and H. Prautzsch, Computing curves invariant under halving, Comput. Aided Geom. Design 4 (1987) 133-140.

    Article  MATH  MathSciNet  Google Scholar 

  17. C.A. Micchelli and H. Prautzsch, Uniform refinement of curves, Linear Algebra Appl. 114/115 (1989) 841-870.

    Article  MathSciNet  Google Scholar 

Download references

Authors
  1. David Levin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Levin, D. Using Laurent polynomial representation for the analysis of non‐uniform binary subdivision schemes. Advances in Computational Mathematics 11, 41–54 (1999). https://doi.org/10.1023/A:1018907522165

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018907522165

Keywords

Search

Navigation