Imran Nasim, Michael E. Henderson
Mathematics
We show that many fundamental algorithms and techniques for B-spline curves extend to geometrically continuous splines. The algorithms, which are all related to knot insertion, include recursive evaluation, differentiation, and change of basis. While the algorithms for geometrically continuous splines are not as computationally simple as those for B-spline curves, they share the same general structure. The techniques we investigate include knot insertion, dual functionals, and polar forms; these prove to be useful theoretical tools for studying geometrically continuous splines. © 1993 J.C. Baltzer AG, Science Publishers.
Imran Nasim, Michael E. Henderson
Mathematics
Matthew A Grayson
Journal of Complexity
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Ligang Lu, Jack L. Kouloheris
IS&T/SPIE Electronic Imaging 2002