检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:欧阳开翠[1]
出 处:《计算机工程与设计》2008年第16期4367-4370,共4页Computer Engineering and Design
摘 要:针对Bézier曲线,提出了一种基于分割点技术的四次Bézier曲线自适应降二阶的算法。通过分析降阶时误差的计算方法,在分割点出现不光顺的情况下采取了相应措施,并根据曲线的性质对算法进行了改进。该算法具有传统降阶算法的几何直观性强、计算简单、容易理解及稳定性好等特点,并取得了较好的逼近效果。The adaptive algorithm to reduce a biquadratic Béziercurve to piecewise quadratic Bézier curves which based on curve subdivision points is presented. By analyses error calculational method, adopted measure while unsmooth occur on the division points, and accordingtothenatureof Bézier cuver, this adaptive algorithm is improved. This algorithm need not to calculate the left degree reduction nor right degree reduction, it directly improves by the nature of the B6zier curve. Compared with other traditional algorithms which reduces a biquadratic Bézier curve to quadratic Bézier curves, this adaptive algorithm acquires much improvement by the research of degree reduction formula of Bézier curve. This algorithm has many advantages such as simply computation, easily understanding and high stability.
关 键 词:BEZIER曲线 降阶 自适应算法 逼近 分割点
分 类 号:TP391.72[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.113