##
**A 4-point interpolatory subdivision scheme for curve design.**
*(English)*
Zbl 0638.65009

The following interpolatory subdivision scheme is analyzed: Given control points \(\{p_ i\in {\mathfrak R}^ d\); \(i=-2,...,n+2\}\), intermediate points are added by the scheme \(p_ i'=(1/2+w)(p_ i+p_{i+1})- w(p_{i-1}+p_{i+2}),\) for -1\(\leq i\leq n\). Iterating this scheme infinitely many times, typically an infinite set of points is obtained. Properties of this set depend on the value of the parameter w. It is shown that for \(| w| <1/4\) the set forms a continuous curve, and for \(0<w<1/8\) the curve is \(C^ 1\). The role of the parameter w is demonstrated by a few examples. It is mentioned, that for some values of w outside the range \(| w| <1/4\) the limiting curve seems to be continuous, but it has many loops and sharp bends and probably can be of Hausdorff dimension \(>1\).

Reviewer: J.Krč-Jediný

### Keywords:

computer-aided curve and surface design; curves; surfaces; point insertion; interpolatory subdivision scheme
PDFBibTeX
XMLCite

\textit{N. Dyn} et al., Comput. Aided Geom. Des. 4, 257--268 (1987; Zbl 0638.65009)

Full Text:
DOI

### References:

[1] | Boehm, W.; Farin, G.; Kahmann, J., A survey of curve and surface methods in CAGD, Computer Aided Geometric Design, 1, 1-60 (1984) · Zbl 0604.65005 |

[2] | Dyn, N.; Levin, D., Smooth interpolation by bisection algorithms, (Chui; Schumaker; Ward, Approximation Theory, 5 (1986)), 335-337 · Zbl 0612.41005 |

[3] | Micchelli, C. A.; Prautzsch, H., Uniform refinement of curves (1987), to appear · Zbl 0651.65003 |

[4] | Weissman, A., (M.Sc. Thesis (1988), Tel-Aviv University), to appear |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.