高效合并多段贝塞尔曲线
Efficient merging of multiple segments of Bézier curves
AI总结：
本文提出一种基于约束双伯恩斯坦多项式基的高效方法，用于合并具有端点连续性约束的贝塞尔曲线段，显著降低算法复杂度。
摘要：
本文研究了复合贝塞尔曲线段的合并问题，端点连续性约束下，提出一种基于约束双伯恩斯坦多项式基的新方法，通过快速评估涉及伯恩斯坦和双伯恩斯坦多项式的连接方案，显著降低算法复杂度。
英文摘要：
This paper deals with the merging problem of segments of a composite Bézier curve, with the endpoints continuity constraints. We present a novel method which is based on the idea of using constrained dual Bernstein polynomial basis (P. Woźny, S. Lewanowicz, Comput. Aided Geom. Design 26 (2009), 566--579) to compute the control points of the merged curve. Thanks to using fast schemes of evaluation of certain connections involving Bernstein and dual Bernstein polynomials, the complexity of our algorithm is significantly less than complexity of other merging methods.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
