Please wait a minute...
J4  2010, Vol. 44 Issue (5): 887-892    DOI: 10.3785/j.issn.1008-973X.2010.05.009
    
Approximate merging of tensor product Bézier surfaces based on
generalized inverse matrix
ZHU Ping1,2, WANG Guo-zhao1
1. Institute of Computer Graphics and Image Processing, Zhejiang University, Hangzhou 310027, China;
2. Department of Mathematics, Southeast University, Nanjing 211189, China
Download:   PDF(0KB) HTML
Export: BibTeX | EndNote (RIS)      

Abstract  

Approximate merging of two adjacent tensor product Bézier surfaces was investigated to guarantee the compression of geometric data in CAD system. The sufficient and necessary condition for precise merging of adjacent tensor product surfaces was obtained by using the matrix representation of subdivided Bézier surface. Then the  merged tensor product Bézier surface was solved by the generalized inverse matrix in L2 norm based on precise merging condition, and the explicit representation of the merged surface’s control points was also obtained. Meanwhile, the results of approximate merging with corner interpolation were shown. Since the minimal least squares solution can be directly obtained by the generalized inverse matrix, the algorithm possesses explicit formula, less time consumption and good approximation results. Numerical results demonstrated the effectiveness of the algorithm.



Published: 19 March 2012
CLC:  TP 391  
Cite this article:

SHU Beng, HONG Guo-Zhao. Approximate merging of tensor product Bézier surfaces based on
generalized inverse matrix. J4, 2010, 44(5): 887-892.

URL:

http://www.zjujournals.com/eng/10.3785/j.issn.1008-973X.2010.05.009     OR     http://www.zjujournals.com/eng/Y2010/V44/I5/887


基于广义逆矩阵的张量积Bézier曲面合并逼近

为了对CAD系统中的几何数据进行压缩,研究2张相邻张量积Bézier曲面合并逼近的问题.为了更好地进行曲面合并逼近,利用张量积Bézier曲面细分后的矩阵表示给出相邻张量积曲面可精确合并的充要条件,在此基础上通过广义逆矩阵的方法求解出在L2范数下合并逼近后的张量积Bézier曲面,得到其控制顶点的显示表达式.同时给出带角点插值条件的曲面合并逼近的结果.利用广义逆矩阵可以方便地求得最小二乘解,得到能够显示表示、算法执行时间最短且逼近效果好的合并逼近算法.数值实例显示了算法的有效性.

[1] HOSCHEK J. Approximate conversion of spline curves[J]. Computer Aided Geometric Design, 1987, 4(1): 5966.[2] HU Qianqian, WANG Guojin. Optimal multidegree reduction of triangular Bézier surfaces with corners continuity in the norm L2[J]. Journal of Computational and Applied Mathematics, 2008, 215: 114126.
[3] CHEN Falai, WU Yang. Degree reduction of disk Bézier curves [J]. Computer Aided Geometric Design, 2004,21(2): 263280.
[4] LU Lizheng, WANG Guozhao. Multidegree reduction of triangular Bézier surfaces with boundary constraints[J]. Computer Aided Design, 2006,38(12): 12151223.
[5] HU Qianqian,WANG Guojin. A novel algorithm for explicit optimal multidegree reduction of triangular surfaces[J]. Science in China Series FInformation Science, 2008,51(1): 1324.
[6] 王国瑾,喻春明.Bézier曲线约束降多阶算法的分析与比较[J].浙江大学学报:工学版,2007,11(41): 18051809.
WANG Guojin,YU Chunming. Analysis and comparison of algorithms for multidegree reduction with constrained Béziercurves[J]. Journal of Zhejiang University: Engineering Science, 2007,11(41):18051809.
[7] HU Shimin, TONG Ruofeng, JU Tao, et al. Approximate merging of a pair of Bézier curves[J]. Computer Aided Design, 2001,33(2): 125136.
[8] TAI Chiewlan, HU Shimin, HUANG Qixing. Approximate merging of Bspline curves via knot adjustment and constrained optimization[J]. Computer Aided Design, 2003, 35: 893899.
[9] WU Yang, CHEN Falai. Merging a pair of disk Bézier curves [C]∥ Proceedings of the 2nd International Conference on Computer graphics and Interactive Techniques in Australasia and South East Asia. Singapore: ACM, 2002: 6570.
[10] 檀敬东,黄有度.两条连续的有理Bézier曲线的逼近合并[J].大学数学,2003,19(6):9497.
TAN Jingdong, HUANG Youdu. Approximate merging of a pair of rational Bézier curves by a rational Bézier curve[J]. College Mathematics, 2003, 19(6): 9497.
[11] 王国瑾,汪国昭,郑建民.计算机辅助几何设计[M].北京:高等教育出版社,海德堡施普林格出版社,2001: 8485.

[1] ZHAO Jian-jun, WANG Yi, YANG Li-bin. Threat assessment method based on time series forecast[J]. J4, 2014, 48(3): 398-403.
[2] CUI Guang-mang, ZHAO Ju-feng,FENG Hua-jun, XU Zhi-hai,LI Qi, CHEN Yue-ting. Construction of fast simulation model for degraded image by inhomogeneous medium[J]. J4, 2014, 48(2): 303-311.
[3] ZHANG Tian-yu, FENG Hua-jun, XU Zhi-hai, LI Qi, CHEN Yue-ting. Sharpness metric based on histogram of strong edge width[J]. J4, 2014, 48(2): 312-320.
[4] LIU Zhong, CHEN Wei-hai, WU Xing-ming, ZOU Yu-hua, WANG Jian-hua. Salient region detection based on stereo vision[J]. J4, 2014, 48(2): 354-359.
[5] WANG Xiang-bing,TONG Shui-guang,ZHONG Wei,ZHANG Jian. Study on  scheme design technique for hydraulic excavator's structure performance based on extension reuse[J]. J4, 2013, 47(11): 1992-2002.
[6] WANG Jin, LU Guo-dong, ZHANG Yun-long. Quantification-I theory based IGA and its application[J]. J4, 2013, 47(10): 1697-1704.
[7] LIU Yu, WANG Guo-jin. Designing  developable surface pencil through  given curve as its common asymptotic curve[J]. J4, 2013, 47(7): 1246-1252.
[8] HU Gen-sheng, BAO Wen-xia, LIANG Dong, ZHANG Wei. Fusion of panchromatic image and multi-spectral image based on
SVR and Bayesian method 
[J]. J4, 2013, 47(7): 1258-1266.
[9] WU Jin-liang, HUANG Hai-bin, LIU Li-gang. Texture details preserving seamless image composition[J]. J4, 2013, 47(6): 951-956.
[10] CHEN Xiao-hong,WANG Wei-dong. A HDTV video de-noising algorithm based on spatial-temporal filtering[J]. J4, 2013, 47(5): 853-859.
[11] ZHU Fan , LI Yue, JIANG Kai, YE Shu-ming, ZHENG Xiao-xiang. Decoding of rat’s primary motor cortex by partial least square[J]. J4, 2013, 47(5): 901-905.
[12] WU Ning, CHEN Qiu-xiao, ZHOU Ling, WAN Li. Multi-level method of optimizing vector graphs converted from remote sensing images[J]. J4, 2013, 47(4): 581-587.
[13] JI Yu, SHEN Ji-zhong, SHI Jin-he. Automatic ocular artifact removal based on blind source separation[J]. J4, 2013, 47(3): 415-421.
[14] WANG Xiang, DING Yong. Full reference image quality assessment based on Gabor filter[J]. J4, 2013, 47(3): 422-430.
[15] TONG Shui-guang, WANG Xiang-bing, ZHONG Wei, ZHANG Jian. Dynamic optimization design for rigid landing leg of crane
based on BP-HGA
[J]. J4, 2013, 47(1): 122-130.