ACM Home Page
Please provide us with feedback. Feedback
The symmetric analogue of the polynomial power basis
Full text PdfPdf (634 KB)
Source ACM Transactions on Graphics (TOG) archive
Volume 16 ,  Issue 3  (July 1997) table of contents
Pages: 319 - 357  
Year of Publication: 1997
ISSN:0730-0301
Author
J. Sánchez-Reyes  Polytechnic Univ. of Catalonia, Barcelona, Spain
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 31,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/256157.256162
What is a DOI?

ABSTRACT

A new polynomial basis over the unit interval t∈0,1 is proposed. The work is motivation by the fact that the monomial (power) form is not suitable in CAGD, as it suffers from serious numerical problems, and the monomial coefficients have no geometric meaning. The new form is the symmetric analogue of the power form, because it can be regarded as an “Hermite two-point expansion” instead of a Taylor expansion. This form enjoys good numerical properties and admits a Horner-like evaluation algorithm that is almost as fast as that of the power form. In a ddition, the symmetric power coeddicients convey a geometric meaning, and therefore they can be used as shape handles. A polynomial expressed in the symmetric power basis is decomposed into linear, cubic, quintic, and successive components. In consequence, this basis is better suited to handle polynomials of different degrees than the Bernstein basis, and those algorithms involving degree operations have extremely simple formulations. The minimum degree of a polynomial is immediately obtained by inspecting its coefficients. Degree reduction of a curve or surface reduces to drooping the desired high degree terms.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
BARNHILL, R.E., ed. 1992. Geometry Processing for Design and Manufacturing. SIAM, Philadelphia, PA.
 
2
BOWYER, A. AND WOODWARK, g. 1993. Introduction to Computing with Geometry. Information Geometers, Winchester, UK.
 
3
BRUNET, P. 1985. Increasing the smoothness of bicubic spline surfaces. Comput. Aided Geom. Des. 2, 157-164.
 
4
CLARIS 1994. Claris Draw, User's Guide. Claris Corporation, Santa Clara, CA.
 
5
COMPUTER ASSOCIATES 1991. CA-Cricket Draw III, User's Guide. Computer Associates International, Inc., Garden City, NY.
 
6
 
7
 
8
 
9
 
10
 
11
 
12
FORREST, A.R. 1972. Interactive interpolation and approximation by B~zier curves. Cornput. J. 15, 71-79.
 
13
 
14
GOODMAN, T. N. T. AND SAID, H.B. 1991b. Properties of generalized Ball curves and surfaces. Comput. Aided Geom. Des. 23, 8 (Oct.), 554-560.
 
15
 
16
 
17
MILLER, R. 1986. Sculptured surfaces in solid models: Issues and alternative approaches. IEEE Comput. Graph Appl. 6, 12 (Dec.), 37-48.
 
18
PIEGL, L. AND TILLER, W. 1995. Algorithm for degree reduction of B-spline curves. Comput. Aided Des. 27, 2, 101-110.
19
 
20
 
21
 
22