Keywords
Bézier curve, bounding, hybrid, perturbation, linear programming
Abstract
In this paper, we put forward and study the problem of bounding an interval rational Bézier curve with an interval polynomial Bézier 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.
Original Publication Citation
Falai Chen, Thomas W. Sederberg and Wenping Lou, "Bounding interval rational Bézier curves with interval polynomial Bézier curves," Geometric modeling and processing 2, IEEE Computer Society, 328-336, 2.
BYU ScholarsArchive Citation
Sederberg, Thomas W.; Chen, Falai; and Lou, Wenping, "Bounding Interval Rational Bézier Curves with Interval Polynomial Bézier Curves" (2000). Faculty Publications. 1107.
https://scholarsarchive.byu.edu/facpub/1107
Document Type
Peer-Reviewed Article
Publication Date
2000-04-12
Permanent URL
http://hdl.lib.byu.edu/1877/2406
Publisher
IEEE
Language
English
College
Physical and Mathematical Sciences
Department
Computer Science
Copyright Status
© 2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Copyright Use Information
http://lib.byu.edu/about/copyright/