arXiv · 1409.2671
Efficient merging of multiple segments of Bézier curves
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Paweł Woźny, Przemysław Gospodarczyk, Stanisław Lewanowicz. 2015-03-23. Efficient merging of multiple segments of Bézier curves. https://arxiv.org/abs/1409.2671
Cite the original work for its findings. Save a collection to share your selection of sources.