DocumentCode :
475311
Title :
Degree reduction and multiple degree reduction for the DP curves
Author :
Itsariyawanich, Kan ; Dejdumrong, Natasha
Author_Institution :
Dept. of Comput. Eng., King Mongkut´´s Univ. of Technol.Thonburi, Bangkok
Volume :
1
fYear :
2008
fDate :
14-17 May 2008
Firstpage :
45
Lastpage :
48
Abstract :
DP curve is a recent representation of the polynomial curves, proposed by Delgado and Pena in 2003. This curve has been claimed for its normalized totally positive (NTP) property and requires only the linear time computation. These properties indicate the shape preservation and the efficiency of evaluating the points on DP curves. Among several important properties of a non-rational curve, the degree reduction of a curve from n into n-1 degrees is very useful for many applications to decrease the complexity of the polynomials. The shape of the curve remains the same although the numbers of control points has been reduced. In this work, the degree reduction and the multiple degree reduction for DP curves has been proposed and well proven by the benefits of the Bezier degree reduction, multiple degree reduction and the relationships between Bezier and DP curves.
Keywords :
computational complexity; computational geometry; curve fitting; polynomials; Bezier degree reduction; DP curves; multiple degree reduction; nonrational curve; polynomial curves; Application software; Computer aided manufacturing; Computer applications; Design automation; Equations; Matrix converters; Polynomials; Shape control; Solid modeling; Spline;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology, 2008. ECTI-CON 2008. 5th International Conference on
Conference_Location :
Krabi
Print_ISBN :
978-1-4244-2101-5
Electronic_ISBN :
978-1-4244-2102-2
Type :
conf
DOI :
10.1109/ECTICON.2008.4600369
Filename :
4600369
Link To Document :
بازگشت