Skip to main content
Article thumbnail
Location of Repository

Optimal Constrained Explicit Multi-degree Reduction Approximation of DP Curves ★

By Gang Liu A and Guojin Wang A B


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 th

Topics: DP Curves, Degree Reduction Approximation, Explicit Expression
Year: 2013
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.