DocumentCode :
2191180
Title :
Quadric Polynomial Interpolation Based on Minimum Local Stretching Energy
Author :
Gao, Shanshan ; Chi, Jing ; Zhang, Caiming
Author_Institution :
Sch. of Comput. Sci. & Technol., Shandong Economic Univ., Beijing
fYear :
2008
fDate :
8-11 July 2008
Firstpage :
342
Lastpage :
347
Abstract :
This paper presents a method to construct C1 polynomial surface with scattered data points. At first the given data points are divided into triangular networks, and then at the adjacent region of each point a C1 piecewise quadric interpolation patch is constructed. Objective function according to the stretching strain energy is constructed. Minimizing the objective function to determine the unknown quantities, and at last achieves fair interpolating surface. The constructed surface has the shape suggested by the given data points. At last comparison examples are included to prove the efficiency of the new method.
Keywords :
computer graphics; interpolation; polynomials; fair interpolating surface; local stretching energy; objective function; piecewise quadric interpolation patch; quadric polynomial interpolation; scattered data points; stretching strain energy; triangular networks; Interpolation; Polynomial Surface; Scattered data points; Stretching Energy;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer and Information Technology Workshops, 2008. CIT Workshops 2008. IEEE 8th International Conference on
Conference_Location :
Sydney, QLD
Print_ISBN :
978-0-7695-3242-4
Electronic_ISBN :
978-0-7695-3239-1
Type :
conf
DOI :
10.1109/CIT.2008.Workshops.79
Filename :
4568527
Link To Document :
بازگشت