• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Zhi Dejia and Wang Guojin. Bézier Approximate Merging by Interval Curves[J]. Journal of Computer Research and Development, 2011, 48(4): 675-682.
Citation: Zhi Dejia and Wang Guojin. Bézier Approximate Merging by Interval Curves[J]. Journal of Computer Research and Development, 2011, 48(4): 675-682.

Bézier Approximate Merging by Interval Curves

More Information
  • Published Date: April 14, 2011
  • This paper mainly deals with the approximate merging problem of multiple adjacent Bézier curves with different degrees by new perspective—a single interval Bézier curve, which is a frequently seen problem in modeling, geometric approximation and data transformation. At first, two methods are given in this paper as theoretical models. One gives the result of the interval Bézier curve by one-sided approximation, which can directly get the values of Bézier control points. The other uses the unified matrix representation for precise merging. The approximate merging center curve is further derived based on matrix operation and the error curve is given by both constant and unconstant interval. Then, several examples are provided to demonstrate the algorithms, which show that the methods in this paper both achieve satisfying merging results and have a good prospect in geometric approximation and data transformation. These methods will be chosen for different results and reasons. More and more, it can be proved that these methods can also be used in the merging process of multiple adjacent rational Bézier curves, in the merging process of multiple adjacent 3D Bézier curves, in the approximate merging problem by a disk Bézier curve and in the approximate merging problem of multiple adjacent Bézier surfaces.
  • Related Articles

    [1]Lu Daying, Zhu Dengming, Wang Zhaoqi. Texture-Based Multiresolution Flow Visualization[J]. Journal of Computer Research and Development, 2015, 52(8): 1910-1920. DOI: 10.7544/issn1000-1239.2015.20140417
    [2]Shao Chao, Zhang Xiaojian. Manifold Clustering and Visualization with Commute Time Distance[J]. Journal of Computer Research and Development, 2015, 52(8): 1757-1767. DOI: 10.7544/issn1000-1239.2015.20150247
    [3]Peng Dichao, Liu Lin, Chen Guangyu, Chen Haidong, Zuo Wuheng, Chen Wei. A Novel Approach for Abstractive Video Visualization[J]. Journal of Computer Research and Development, 2013, 50(2): 371-378.
    [4]Xu Huaxun, Ma Qianli, Cai Xun, and Li Sikun. The Topology Voronoi Graph of Visualizing Local Vector Field[J]. Journal of Computer Research and Development, 2011, 48(4): 666-674.
    [5]Zhan Yubin, Yin Jianping, Liu Xinwang, Zhang Guomin. Adaptive Neighborhood Selection Based on Local Linearity for Manifold Learning[J]. Journal of Computer Research and Development, 2011, 48(4): 576-583.
    [6]Meng Deyu, Xu Zongben, Dai Mingwei. A New Supervised Manifold Learning Method[J]. Journal of Computer Research and Development, 2007, 44(12): 2072-2077.
    [7]Shao Chao, Huang Houkuan. A New Data Visualization Algorithm Based on ISOMAP[J]. Journal of Computer Research and Development, 2007, 44(7): 1137-1143.
    [8]Luo Siwei and Zhao Lianwei. Manifold Learning Algorithms Based on Spectral Graph Theory[J]. Journal of Computer Research and Development, 2006, 43(7): 1173-1179.
    [9]Shao Chao and Huang Houkuan. A New Data Visualization Algorithm Based on SOM[J]. Journal of Computer Research and Development, 2006, 43(3): 429-435.
    [10]Zhan Dechuan and Zhou Zhihua. Ensemble-Based Manifold Learning for Visualization[J]. Journal of Computer Research and Development, 2005, 42(9): 1533-1537.

Catalog

    Article views (674) PDF downloads (495) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return