• DocumentCode
    2347521
  • Title

    Rational DP-Ball Curves

  • Author

    Dejdumrong, Natasha

  • Author_Institution
    Dept. of Comput. Eng., King Mongkut´´s Inst. of Technol., Bangkok
  • fYear
    2006
  • fDate
    26-28 July 2006
  • Firstpage
    478
  • Lastpage
    483
  • Abstract
    In this paper, a normalized totally positive (NTP) basis given by Delgado and Pena is used to form non-rational and rational DP-Ball curves. The relationships between rational Bezier and rational DP-Ball curves are given using homogeneous coordinates. Consequently, an efficient algorithm with linear computational complexity is introduced in order to be used in evaluating the points on rational Bezier curve. Although the elegant de Casteljau algorithm is proven to be simple and stable. Unfortunately, compared with the linear time complexity of the proposed algorithm, it is not efficient. This algorithm can be used as an alterative algorithm to the popular Wang algorithm
  • Keywords
    computational complexity; computational geometry; curve fitting; Casteljau algorithm; linear computational complexity; linear time complexity; rational Bezier curve; rational DP-Ball curve; Computational complexity; Computer graphics; Polynomials; Shape; Stability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Graphics, Imaging and Visualisation, 2006 International Conference on
  • Conference_Location
    Sydney, Qld.
  • Print_ISBN
    0-7695-2606-3
  • Type

    conf

  • DOI
    10.1109/CGIV.2006.74
  • Filename
    1663836