Gregory-Qu算法与Hermite细分曲线构造法的比较  

Comparison between Gregory-Qu Algorithm and Hermite Interpolatory Subdivision Scheme

作　　者：高翠霞[1] 韩臻[1] 李凯[1] 罗颖[1] 

机构地区：[1]北方交通大学计算机与信息技术学院,北京100044

出　　处：《计算机辅助设计与图形学学报》2003年第3期329-333,共5页Journal of Computer-Aided Design & Computer Graphics

基　　金：教育部科学技术研究重点项目基金 ( 0 10 41)资助

摘　　要：首先分别介绍了Gregory Qu算法和Hermite细分曲线构造法的细分规则 ,以及各自生成C1连续曲线的条件范围 通过对两种算法的比较得出 :定常Gregory Qu算法是定常Hermite细分算法的一个特例 Hermite细分曲线构造法不仅有更弱的C1连续性的条件 。The subdivision rules of Gregory-Qu algorithm and Hermite interpolatory subdivision scheme, including the conditions of C 1 continuity, are presented. Analysing the two schemes, we conclude that stationary Gregory-Qu algorithm is a special case of stationary Hermite interpolatory subdivision. And Hermite interpolatory subdivision scheme not only has the weaker conditions of C 1 continuity, but also generates the limit curve more flexibly.

关 键 词：HERMITE插值 细分 C^1连续性 Gregory-Qu算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]