Approximation by interval Bezier curves
- 1 September 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 12 (5), 87-95
- https://doi.org/10.1109/38.156018
Abstract
The interval Bezier curve, which, unlike other curve and surface approximation schemes, can transfer a complete description of approximation errors between diverse CAD/CAM systems that impose fundamentally incompatible constraints on their canonical representation schemes, is described. Interval arithmetic, which offers an essentially infallible way to monitor error propagation in numerical algorithms that use floating-point arithmetic is reviewed. Affine maps, the computations of which are key operations in the de Casteljau subdivision and degree-elevation algorithms for Bezier curves, the floating-point error propagation in such computations, approximation by interval polynomials, and approximation by interval Bezier curves are discussed.Keywords
This publication has 5 references indexed in Scilit:
- Algorithms for polynomials in Bernstein formComputer Aided Geometric Design, 1988
- On the numerical condition of polynomials in Bernstein formComputer Aided Geometric Design, 1987
- Interval Methods for Processing Geometric ObjectsIEEE Computer Graphics and Applications, 1984
- Interval forms of Newtons methodComputing, 1978
- Reducing the degree of an interval polynomialComputing, 1975