PIA for B-spline Surface Approximation with Normal Constraint
CSTR:
Author:
  • Article
  • | |
  • Metrics
  • |
  • Reference [15]
  • |
  • Related [20]
  • | | |
  • Comments
    Abstract:

    In this paper, we propose a progressive iterative approximation (PIA) algorithm for B-spline surface approximation with normal constraint. On the one hand, the discrete data points of the tangent vector, normal vector, curvature and other geometric characteristics are fully applied to the approximation problem of discrete data points, using the two directions of the tangent vector to construct normal constraint can avoid unnecessary fluctuations, and obtain better approximation effect. On the other hand, the number of selecting feature points is less than the number of data points, so the PIA algorithm can be used for the approximation of the mass of discrete data points. The steps in the process of each iteration of the algorithm are independent, which is easy to be applied to the parallel computing, which greatly improve the computational efficiency. Some examples are given to show the validity of the algorithm.

    Reference
    1 Rogers DF, Fog NG. Constrained B-spline curve and surface fitting. Computer-Aided Design, 1989, 21(10): 641-648.
    2 Pigl LA. surface approximation to scanned data. The Visual Computer, 2000, (7): 386-395.
    3 Meek DS, Walton DJ. On surface normal and Gaussian curvature approximations given data sampled from a smooth surface. Computer-Aided Design, 2000, 17: 521-543.
    4 Dey TK, Sun J. Normal and feature Approximation from Noisy Point Clouds[Technical Report]. OSU-CISRC-4-05- TR26(2005). 2005.
    5 Lin HW, Wang GJ, Dong CS. Constructing iterative non-uniform B-spline curve and surface to fit data points. Science in China Series F: information Sciences, 2004, 47(3): 315-331.
    6 Lin H, Zhang Z. An extended iterative format for the progressive-iteration approximation. Computers & Graphics, 2011, 35: 967-975.
    7 Kineri YK, Wang MS, Lin HW, Maekawa T. B-spline surface fitting by iterative geometric interpolation/approximation algotithms. Computer-Aided Design, 2012, 44(7): 697-708.
    8 Deng CY, Lin HW.Progressive and iterative approximation for least squares B-spline curve and surface fitting. Computer -Aided Design, 2014, 47: 32-44.
    9 Gofuku S, Shigefumi T, Takashi M.Point-tangent/point-normal B-spline curve interpolation by geometric algorithms. Computer -Aided Design, 2009, 41(6): 412-422.
    10 施法中.计算机辅助几何设计与非均匀有理B样条.北京: 北京航空航天大学出版社,1994.
    11 Carnicer JM. Delgado J, Pena JM. Progressive-iteration approximation and geometric algorithm. Computer-Aided Design, 2012, 44(2): 143-153.
    12 Piegl L,Tiller W. The NURBS Book. Springer-Verlag, 1997.
    13 Yu TH. An algorithm for accurately estimating the normal and curature of scattered points cloud. Machinery Design & Manufacture, 2005, 12(2): 169-223.
    14 Park H. B-spline surface fitting based on adaptive knot placement using dominant columns. Computer-Aided Design, 2011, 23(11): 223-237.
    15 Park H, Lee JH. B-spline curve fitting based on adaptive curve refinement using dominant points. Computer-Aided Design, 2007, 39(6): 439-451.
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

黄丽琴,潘日晶,林传銮,陈青.基于法矢控制的B样条曲面逼近的PIA方法.计算机系统应用,2015,24(6):100-107

Copy
Share
Article Metrics
  • Abstract:1557
  • PDF: 2962
  • HTML: 0
  • Cited by: 0
History
  • Received:October 16,2014
  • Revised:November 28,2014
  • Online: June 09,2015
Article QR Code
You are the first990502Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063