GC^1约束的三角Bézier曲面降阶逼近研究  

Investigation of approximate multi-degree reduction of triangular Bézier surfaces based on GC^1 constraint

作　　者：黄俊英[1] 王相海[1,2] 

机构地区：[1]辽宁师范大学计算机与信息技术学院,辽宁大连116029 [2]浙江大学CAD＆CG国家重点实验室,杭州310027

出　　处：《计算机工程与应用》2009年第11期196-198,248,共4页Computer Engineering and Applications

基　　金：辽宁省自然科学基金No.20072156;辽宁省高等学校优秀人才支持计划(No.RC-04-11);辽宁省教育厅科学技术研究项目(No.20060486)~~

摘　　要：研究给定的n次三角Bézier曲面在L2范数下的一次降多阶的逼近问题,给出了在无约束条件下的三角Bézier曲面降阶求解的详细过程,将降阶问题转化为非线性最优化问题求解,并将降阶过程与曲面的几何连续拼接结合在一起,给出了降阶同时满足GC1拼接的实现过程。实验结果表明,该方法简单实用,降阶逼近效果好。The approximate multi-degree reduction problem of triangular Bézier surface of degree n is researched by minimizing the defined distance function.A detailed process of the degree reduction for triangular Bézier surfaces is presented based on unconstraint,then the problem of multi-degree reduction is transformed into computational methods for nonlinear optimization. Through combining multi-degree reduction with geometric continuity of surfaces, a realized process of the degree reduction is presented based on GC^1 constraint.Experimental results show that this algorithm is very efficient.

关 键 词：三角BÉZIER曲面 降阶 GC1拼接 几何连续 

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