摘要

This paper presents an iterative algorithm for G(2) multiwise merging of Bezier curves. By using the G(2) constraint, the L-2 distance is represented after simplification as a quartic polynomial in two parameters relating to the magnitudes of end tangents of the merged curve. These two parameters are restricted in a feasible region, in order for the merged curve to preserve the specified directions of end tangents. Then G(2) multiwise merging is formulated as a constrained minimization problem, and the classic projected Newton method is applied to find the minimizer. Some extensions of multiwise merging using G(3) constraints, other energy functionals and curve representations are also outlined. Several comparative examples are provided to demonstrate the effectiveness of the proposed method.

全文