Abstract
We present a simple change of basis technique for transforming one type of Pólya curve to another closely related Pólya curve form. Repeated use of this method yields algorithms for transforming one arbitrary Pólya form to another, as well as algorithms for evaluating, subdividing, and differentiating Pólya curves. These procedures can be applied to almost all Pólya curves, including Bézier curves and Lagrange interpolating polynomials.
Similar content being viewed by others
References
A.A. Ball, CONSURF I: introduction of the conic lofting tile, Computer-Aided Design 6 (1974) 243–249.
P.J. Barry, Urn models, recursive curve schemes, and computer aided geometric design, Ph.D. dissertation, Dept. of Math., Univ of Utah, Salt Lake City, 1987.
P.J. Barry, T.D. Derose and R.N. Goldman, B-splines, Pólya curves, and duality, Journal of Approximation Theory, to appear.
P.J. Barry and R.N. Goldman, Interpolation and approximation of curves and surfaces using Pólya polynomials, Computer Vision, Graphics, and Image Processing, to appear.
C. de Boor and K. Höllig, B-splines without divided differences, in:Geometry Modeling: New Trends and Algorithms, ed. G. Farin (SIAM, Philadelphia, 1987), 21–27.
R.N. Goldman, Markov chains and computer aided geometric design: Part I-Problems and constraints, ACM Transactions on Graphics 3 (1984) 204–222.
R.N. Goldman, Pólya's urn model and computer aided geometric design, SIAM Journal on Algebraic and Discrete Methods 6 (1985) 1–28.
S. Karlin,Total Positivity (Stanford University Press, Stanford, California, 1968).
T. Pavlidis,Algorithms for Graphics and Image Processing (Computer Science Press, Rockville, Maryland, 1982).
D.D. Stancu, Approximation of functions by a new class of linear polynomial operators, Rev. Roum. Pures et Appl. 13 (1968) 1173–1194.
Author information
Authors and Affiliations
Additional information
Communicated by C.A. Micchelli
Rights and permissions
About this article
Cite this article
Barry, P.J., Goldman, R.N. Shape parameter deletion for Pólya curves. Numer Algor 1, 121–137 (1991). https://doi.org/10.1007/BF02142317
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02142317