Loading...
Please wait, while we are loading the content...
Similar Documents
Optimal constrained explicit multi-degree reduction approximation of dp curves ★.
| Content Provider | CiteSeerX |
|---|---|
| Author | Gang Liu, A. Guojin Wang A., B. |
| Abstract | DP curves, which possess the shape-preserving property and linear complexity evaluation algorithm, occupy a significantly important place in computer aided geometric design. Thus to do the research on the DP curves algorithms has a positive meaning. Aphirukmatakun et al. presented a degree elevation algorithm of DP curves based on the transformation between the DP basis and power basis. At the same time, Itsariyawanich et al. put forward a degree reduction algorithm. However, up to now, there has been no optimal algorithm for explicit multi-degree reduction of DP curves with endpoints constraints. In this paper, based on the orthogonality of Jacobi basis, we give out an effective algorithm of constrained multi-degree reduction approximation of DP curve. We prove that the approximation is optimal in the |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Dp Curve Explicit Multi-degree Reduction Approximation Explicit Multi-degree Reduction Endpoint Constraint Degree Elevation Algorithm Jacobi Basis Degree Reduction Algorithm Shape-preserving Property Optimal Algorithm Positive Meaning Power Basis Geometric Design Dp Basis Important Place Linear Complexity Evaluation Algorithm Multi-degree Reduction Approximation Effective Algorithm |
| Content Type | Text |
