摘要
隐多项式曲线一直没有理想的生成算法,给出了一种针对二维n次隐多项式曲线的快速逐点生成算法,该算法思路简洁,在逐点生成过程中,只用到整数加减法,故速度快,效率高,具有广泛的应用价值。最后,运用算法给出了曲线生成实例和对算法效率的比较,比较结果表明本文提出的算法有效的提高了生成曲线的效率。
There are few fast algorithms of generating implicit polynomial curve. A fast point-by-point algorithm for generating implicit polynomial curve is presented. The basic idea of this algorithm is simple. It is quite efficient because only integer additive and subtractive operations are involved during the process of generating the curve point by point. Thus it is widely used in generating implicit polynomial curve. At the end, some curves generated using the algorithm are presented and the efficiency comparation result is given. The result show that the efficiency of curve drawing is improved effectively.
出处
《计算机工程与设计》
CSCD
北大核心
2006年第20期3768-3770,共3页
Computer Engineering and Design
基金
国家自然科学基金项目(60473108)
关键词
逐点生成算法
隐多项式曲线
BÉZIER曲线
曲线绘制
整数加减法
point-by-point generating algorithm
implicit polynomial curve
Bézier curve
curve drawing
integer additive and substractive operations
