Efficient degree reduction of Bézier curves with box constraints using dual bases

2015/11/24 by Przemysław Gospodarczyk, Gospodarczyk, Przemysław, Paweł Woźny +1
Engineering · Computer Science · #Advanced Numerical Analysis Techniques #Computer Graphics and Visualization Techniques #Advanced Vision and Imaging

paper · pdf · doi:10.48550/arxiv.1511.08264

Abstract

In this paper, we give an efficient algorithm of degree reduction of Bézier curves with box constraints. The idea is to combine the previous iterative approach, that has been presented recently in (P. Gospodarczyk, Comput. Aided Des. 62 (2015), 143--151), with a fast method of construction of dual bases from (P. Woźny, J. Comput. Appl. Math. 260 (2014), 301--311) and a new efficient method of modification of dual bases.

Related

• Efficient modified Jacobi-Bernstein basis transformations
• Efficient merging of multiple segments of Bézier curves
• Degree reduction of disk rational Bézier curves
• An enhanced basis for producing Bezier-like curves
• Approximating rational Bezier curves by constrained Bezier curves of arbitrary degree