# zbMATH — the first resource for mathematics

An interpolating 4-point $$C^2$$ ternary stationary subdivision scheme. (English) Zbl 0984.68167
Summary: A novel 4-point ternary interpolatory subdivision scheme with a tension parameter is analyzed. It is shown that for a certain range of the tension parameter the resulting curve is $$C^{2}.$$ The role of the tension parameter is demonstrated by a few examples. There is a brief discussion of computational costs.

##### MSC:
 68U05 Computer graphics; computational geometry (digital and algorithmic aspects)
##### Keywords:
subdivision; interpolation; curves; ternary
Full Text:
##### References:
 [1] Deslauriers, G.; Dubuc, S., Symmetric iterative interpolation processes, Constr. approx., 5, 49-68, (1989) · Zbl 0659.65004 [2] Doo, D.; Sabin, M., Behaviour of recursive division surfaces near extraordinary points, Computer-aided design, 10, 356-360, (1978) [3] Dubuc, S., Interpolation through an iterative scheme, J. math. anal. appl., 114, 185-204, (1986) · Zbl 0615.65005 [4] Dyn, N., Subdivision schemes in computer-aided geometric design, (), 36-104 · Zbl 0760.65012 [5] Dyn, N.; Levin, D.; Gregory, J.A., A 4-point interpolatory subdivision scheme for curve design, Computer aided geometric design, 4, 257-268, (1987) · Zbl 0638.65009 [6] Hassan M.F., Dodgson N.A., 2001. Ternary and 3-point univariate subdivision schemes. University of Cambridge, Computer Laboratory Technical Report No. 520 · Zbl 1037.65024 [7] Kobbelt, L., $$3$$-subdivision, SIGGRAPH 00 conference Proceedings, (2000) [8] Warren J., t.a. Subdivision methods for geometric design. Unpublished manuscript [9] Weissman, A., A 6-point interpolatory subdivision scheme for curve design, M.sc. thesis, (1990), Tel-Aviv University
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.