摘要
提出了一种基于权因子的有理 Bézier曲线细分算法 ,取分点参数值为 t=1 +( wnw0) 1n-1.本算法适用于任意次数的权因子大小任意的有理 Bézier曲线 (特别是权因子大小悬殊较大的曲线 ) ,能较均匀地细分曲线 ,从而能用较少的细分次数得到对曲线较好的逼近效果 .本算法计算较简单且易实现 ,应用于有理 Bézier曲线的求交、几何作图等算法中可提高算法效率 ,有较好的实用性 .此外还对几种细分算法进行比较 ,并给出例子 .
A weight-based subdivision algorithm for rational Bézier curves is given with the parameter value of the subdividing point designated to t=1 + (wnw0 ) 1n - 1.This algorithm can be applied to a wide variety of rational Béziercurvesof arbitrary degreewith arbitrary weights(especially with relatively big weights) ,and can subdivide the curves more evenly than other subdivision methods.With this algorithm the better approximation to the curves can be obtained with less subdivision steps.So the subdivision-based algorithms such as curve intersection,curve drawing algorithms can be improved by using this subdivision algorithm.In addition,some examples are given for a comparison of the three subdivision methods.
出处
《福建师范大学学报（自然科学版）》
CAS
CSCD
2000年第3期25-30,共6页
Journal of Fujian Normal University：Natural Science Edition
