期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Computing knots by quadratic and cubic polynomial curves 被引量:3
1
作者 Fan Zhang Jinjiang Li +1 位作者 peiqiang liu Hui Fan 《Computational Visual Media》 EI CSCD 2020年第4期417-430,共14页
A new method is presented to determine parameter values(knot)for data points for curve and surface generation.With four adjacent data points,a quadratic polynomial curve can be determined uniquely if the four points f... A new method is presented to determine parameter values(knot)for data points for curve and surface generation.With four adjacent data points,a quadratic polynomial curve can be determined uniquely if the four points form a convex polygon.When the four data points do not form a convex polygon,a cubic polynomial curve with one degree of freedom is used to interpolate the four points,so that the interpolant has better shape,approximating the polygon formed by the four data points.The degree of freedom is determined by minimizing the cubic coefficient of the cubic polynomial curve.The advantages of the new method are,firstly,the knots computed have quadratic polynomial precision,i.e.,if the data points are sampled from a quadratic polynomial curve,and the knots are used to construct a quadratic polynomial,it reproduces the original quadratic curve.Secondly,the new method is affine invariant,which is significant,as most parameterization methods do not have this property.Thirdly,it computes knots using a local method.Experiments show that curves constructed using knots computed by the new method have better interpolation precision than for existing methods. 展开更多
关键词 KNOT interpolation polynomial curve affine invariant
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部