The convexity of curves and surfaces is an important property in the field of Computer Aided Geometric Design (CAGD). This paper tries to tackle the positive and convex problem of polynomials. Convexity can be solved by positivity. An algorithm for the positivity of polynomials is developed by extending the classic Sturm theorem. Hence, a necessary and sufficient condition for the positivity of polynomials of arbitrary degree is presented in this paper. A practical algorithm to express this condition in terms of the coefficients of the polynomials is also given.%在计算机辅助几何设计(CAGD)中,曲面曲线的凸性是一种重要的特性.旨在解决多项式的正性和凸性问题.凸性可以通过正性来解决.通过推广经典的Sturm定理,得到一种多项式正性的算法.由此提出了任意阶多项式为正的一个充要条件,也提出了一个实用的算法,从而可以只用此多项式的系数来表示得到的充要条件.
展开▼