DocumentCode :
1940739
Title :
Bounding interval rational Bezier curves with interval polynomial Bezier curves
Author :
Falai Chen ; Sederberg, T.W. ; Wenping Lou
Author_Institution :
Dept. of Math., Univ. of Sci. & Technol. of China, Hefei, China
fYear :
2000
fDate :
10-12 April 2000
Firstpage :
328
Lastpage :
336
Abstract :
In this paper we put forward and study the problem of bounding an interval rational Bezier curve with an interval polynomial Bezier curve. We propose three different methods-hybrid method, perturbation method and linear programming method to solve this problem. Examples are illustrated to compare the three different methods. The empirical results show that the perturbation method and the linear programming method produce much tighter bounds than the hybrid method, though they are computationally several times more expensive.
Keywords :
computational geometry; linear programming; hybrid method; interval polynomial Bezier curves; interval rational Bezier curve; interval rational Bezier curves; linear programming method; perturbation method; tighter bounds; Approximation error; Approximation methods; Arithmetic; Character generation; Linear programming; Mathematics; Numerical analysis; Tolerance analysis;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Geometric Modeling and Processing 2000. Theory and Applications. Proceedings
Conference_Location :
Hong Kong, China
Print_ISBN :
0-7695-0562-7
Type :
conf
DOI :
10.1109/GMAP.2000.838264
Filename :
838264
Link To Document :
بازگشت