A New Definition of the Dual Interpolation Curve for CAD Modeling and Geometry Defeaturing

The present paper provides a new definition of the dual interpolation curve in a geometric-intuitive way based on adaptive curve refinement techniques. The dual interpolation curve is an implementation of the interpolatory subdivision scheme for curve modeling, which comprises polynomial segments of different degrees. Dual interpolation curves maintain various desirable properties of conventional curve modeling methods, such as local adaptive subdivision, high interpolation accuracy and convergence, and continuous and discontinuous boundary representation. In addition, the dual interpolation curve is mainly applied to solve the difficult geometry defeaturing problems for curve modeling in existing computer-aided technology. By adding fictitious and intrinsic nodes inside or at the vertices of interpolation elements, the dual interpolation curve is flexible and convenient for characterizing a set of ordered points or discrete segments. Combined with the Lagrange interpolation polynomial and meshless method, the proposed approach is capable of characterizing the non-smooth boundary for geometry defeaturing. Experimental results are given to verify the validity, robustness, and accuracy of the proposed method.

Automated summary

The present paper provides a new definition of the dual interpolation curve using adaptive curve refinement techniques. The dual interpolation curve is a curve modeling scheme that utilizes polynomial segments of varying degrees. It maintains desirable properties of conventional curve modeling methods and is particularly useful for solving geometry defeaturing problems in computer-aided technology. The proposed approach combines Lagrange interpolation polynomial and meshless method to characterize non-smooth boundaries for geometry defeaturing.