DocumentCode
1620256
Title
Recursive subdivision and hypergeometric functions
Author
Ivrissimtzis, I.P. ; Dodgson, N.A. ; Sabin, M.A.
Author_Institution
Comput. Lab., Cambridge Univ., UK
fYear
2002
fDate
6/24/1905 12:00:00 AM
Firstpage
29
Lastpage
34
Abstract
We describe a method for efficient calculation of coefficients for subdivision schemes. We work on the unit sphere and we express the z-coordinate of all the existing points as power series in the variable cos θ. Any linear combination of them is also a power series in cos θ and, by solving a linear system, we determine the linear combination that will give the smoothest interpolation of the sphere at a particular point
Keywords
computational geometry; polynomials; series (mathematics); coordinate; hypergeometric functions; interpolation; linear system; power series; recursive subdivision; unit sphere; Artificial intelligence; Character generation; Chebyshev approximation; Chromium; Euclidean distance; Geometry; Optimization methods; Polynomials; Shape; Spectral analysis;
fLanguage
English
Publisher
ieee
Conference_Titel
Shape Modeling International, 2002. Proceedings
Conference_Location
Banff, Alta.
Print_ISBN
0-7695-1546-0
Type
conf
DOI
10.1109/SMI.2002.1003525
Filename
1003525
Link To Document