Effective C1G2-merging of Two Bezier Curves by Matrix Computation

The merging of polynomial curves is frequently required when modeling the complex shape in geometric design and related applications. In this paper, we present an effective method for the CGmerging of two Bezier curves by using matrix computation. By minimizing the distance function defined in terms of control points, the optimal merged curve is obtained and expressed in the matrix form. Due to the two variables available from the conditions of CG-continuity at the endpoints, the merged curve in this way is clearly better than that obtained by the C-merging. Numerical examples are provided to demonstrate the effectiveness of the proposed method.