Name
Abstract | ||
|---|---|---|
Interval Bezier curves are new representation forms of parametric curves that can embody a complete description of coefficient errors. Using this new representation, the problem of lack of robustness in all state-of-the-art CAD systems can be largely overcome. In this paper, we discuss the problem of bounding interval Bezier curves with lower degree interval Bezier curves. We propose two different methods-Linear Programming and Optimal Approximation to solve this problem and provide several examples to demonstrate the algorithms. The examples show that while the Linear Programming method generally gives quite good bound, the Optimal Approximation algorithm provides much tighter approximation interval curves than the previous methods. (C) 2000 Published by Elsevier Science Ltd. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0010-4485(00)00021-X | COMPUTER-AIDED DESIGN |
Keywords | Field | DocType |
interval Bezier curve, interval arithmetic, degree reduction, CAD | Approximation algorithm,Mathematical optimization,Parametric equation,Family of curves,Robustness (computer science),Bézier curve,Linear programming,Interval arithmetic,Mathematics,Bounding overwatch | Journal |
Volume | Issue | ISSN |
32 | 10 | 0010-4485 |
Citations | PageRank | References |
9 | 0.94 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Falai Chen | 1 | 403 | 32.47 |
| Wenping Lou | 2 | 12 | 1.52 |