A Generalized Ball Curve and Its Recursive Algorithm

126Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

Abstract

The use of Bernstein polynomials as the basis functions in Bézier’s UNISURF is well known. These basis functions possess the shape-preserving properties that are required in designing free form curves and surfaces. These curves and surfaces are computed efficiently using the de Casteljau Algorithm. Ball uses a similar approach in defining cubic curves and bicubic surfaces in his CONSURF program. The basis functions employed are slightly different from the Bernstein polynomials. However, they also possess the same shape-preserving properties. A generalization of these cubic basis functions of Ball, such that higher order curves and surfaces can be defined and a recursive algorithm for generating the generalized curve are presented. The algorithm could be extended to generate a generalized surface in much the same way that the de Casteljau Algorithm could be used to generate a Bézier surface. © 1989, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Said, H. B. (1989). A Generalized Ball Curve and Its Recursive Algorithm. ACM Transactions on Graphics (TOG), 8(4), 360–371. https://doi.org/10.1145/77269.77275

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free