Dierckx P (1982) Algorithms for Smoothing Data with Periodic and Parametric Splines. Computer Graphics and Image Processing 20: 171-184. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Optimal Spline Fitting to Planar Shape - Lu, Milios (1994) (4 citations) (Correct)
....approximation, which has been extensively studied by the computer graphics community [5] 6] 7] Local spline approximation is attractive in that it gives a smooth analytic representation of the curve. Much work has been done on representing signals or images using cubic spline models [8] 9] 10] 11][12]. The problem we want to solve in this paper is the following. Given a planar curve represented as a sequence of sample points, find a spline with a number of control points to approximate the curve such that the approximation error is minimum. Our approach is to treat the positions of the control ....
P. Dierckx, "Algorithms for Smoothing Data with Periodic and Parametric Splines", Comp. Graphics Image Process. 20, 1982, 171--184.
Sketching 3D Animations - Balaguer, Gobbetti (1995) (Correct)
No context found.
Dierckx P (1982) Algorithms for Smoothing Data with Periodic and Parametric Splines. Computer Graphics and Image Processing 20: 171-184.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC