Abstract
Principles and basic algorithms for evaluating polynomial functions by Forward Differencing (FD) and Adaptive Forward Differencing (AFD) are presented. Both techniques are used nowadays in scanning/display algorithms for parameteric polynomial surfaces by generating and displaying a set of points. Constraints to be put on such a set of points are made explicit. One FD and two AFD surface-scanning/display algorithms presented in literature are evaluated in terms of these constraints. The FD algorithm is proved to be valid, but the AFD algorithms are shown to be incorrect. A valid AFD algorithm is presented.
Similar content being viewed by others
References
Bronsvoort WF (1990) Direct display algorithms for solid modelling (PhD thesis). Delft University Press, Delft, pp 99–108
Issacson E, Keller HB (1966) Analysis of numerical methods. Wiley and Sons, New York
Lien S-L, Shantz M, Pratt V (1987) Adaptive forward differencing for rendering curves and surfaces. Comput Graph 21(4):111–118
Newman WM, Sproull RF (1979) Principles of interactive computer graphics. McGraw-Hill, London
Press WH, Flannery BP, Teukolsky SA, Vetterling WT (1988) Numerical recipes in C, the art of scientific computing. Cambridge University Press, Cambridge
Rockwood AR (1987) A generalized scanning technique for display of parametrically defined surfaces. IEEE Comput Graph Appl 7(8):15–26
Shantz M, Chang S-L (1988) Rendering trimmed NURBS with adaptive forward differencing. Comput Graph 22(4):189–198
Author information
Authors and Affiliations
Additional information
This research was partially done at the Faculty of Technical Mathematics and Informations of the Delft University of Technology, Delft, The Netherlands
Rights and permissions
About this article
Cite this article
Steketee, J.J. Step length in forward differencing for curved surface display. The Visual Computer 8, 35–46 (1991). https://doi.org/10.1007/BF01900844
Issue Date:
DOI: https://doi.org/10.1007/BF01900844