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

@article{Levin1999UsingLP,
  title={Using Laurent polynomial representation for the analysis of non-uniform binary subdivision schemes},
  author={David Levin},
  journal={Adv. Comput. Math.},
  year={1999},
  volume={11},
  pages={41-54}
}
Starting with values {f 0 j }j∈Z assigned to the integers, a binary subdivision scheme defines recursively values {fk j }j∈Z, respectively assigned to the binary points {2−kj}j∈Z. The purpose of subdivision analysis is to study the convergence of such processes and to establish the existence of a limit function on R and its smoothness class. A general… CONTINUE READING