TY - JFULL AU - Taweechai Nuntawisuttiwong and Natasha Dejdumrong PY - 2019/9/ TI - Fast and Efficient Algorithms for Evaluating Uniform and Nonuniform Lagrange and Newton Curves T2 - International Journal of Computer and Information Engineering SP - 439 EP - 444 VL - 13 SN - 1307-6892 UR - https://publications.waset.org/pdf/10010689 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 152, 2019 N2 - Newton-Lagrange Interpolations are widely used in numerical analysis. However, it requires a quadratic computational time for their constructions. In computer aided geometric design (CAGD), there are some polynomial curves: Wang-Ball, DP and Dejdumrong curves, which have linear time complexity algorithms. Thus, the computational time for Newton-Lagrange Interpolations can be reduced by applying the algorithms of Wang-Ball, DP and Dejdumrong curves. In order to use Wang-Ball, DP and Dejdumrong algorithms, first, it is necessary to convert Newton-Lagrange polynomials into Wang-Ball, DP or Dejdumrong polynomials. In this work, the algorithms for converting from both uniform and non-uniform Newton-Lagrange polynomials into Wang-Ball, DP and Dejdumrong polynomials are investigated. Thus, the computational time for representing Newton-Lagrange polynomials can be reduced into linear complexity. In addition, the other utilizations of using CAGD curves to modify the Newton-Lagrange curves can be taken. ER -