Numerical Recipes in C++: the art of scientific computing
Numerical Recipes in C++: the art of scientific computing
Approximation with Active B-Spline Curves and Surfaces
PG '02 Proceedings of the 10th Pacific Conference on Computer Graphics and Applications
Using Jacobi polynomials for degree reduction of Bézier curves withCk-constraints
Computer Aided Geometric Design
Computer Aided Geometric Design
Geometric Hermite interpolation: in memoriam Josef Hoschek
Computer Aided Geometric Design - Special issue: Geometric modelling and differential geometry
High accuracy geometric Hermite interpolation
Computer Aided Geometric Design
A note on morphological development and transformation of Bézier curves based on ribs and fans
Proceedings of the 2007 ACM symposium on Solid and physical modeling
Constrained degree reduction of polynomials in Bernstein-Bézier form over simplex domain
Journal of Computational and Applied Mathematics
Application of Chebyshev II-Bernstein basis transformations to degree reduction of Bézier curves
Journal of Computational and Applied Mathematics
Multi-degree reduction of Bézier curves with constraints, using dual Bernstein basis polynomials
Computer Aided Geometric Design
Approximating tensor product Bézier surfaces with tangent plane continuity
Journal of Computational and Applied Mathematics
Hermite approximation for free-form deformation of curves and surfaces
Computer-Aided Design
Linear methods for G1, G2, and G 3-Multi-degree reduction of Bézier curves
Computer-Aided Design
Explicit G2-constrained degree reduction of Bézier curves by quadratic optimization
Journal of Computational and Applied Mathematics
Optimal multi-degree reduction of Bézier curves with geometric constraints
Computer-Aided Design
Hi-index | 0.00 |
In this paper we present a novel approach to consider the multi-degree reduction of Bezier curves with G^2-continuity in L"2-norm. The optimal approximation is obtained by minimizing the objective function based on the L"2-error between the two curves. In contrast to traditional methods, which typically consider the components of the curve separately, we use geometric information on the curve to generate the degree reduction. So positions, tangents and curvatures are preserved at the two endpoints. For avoiding the singularities at the endpoints, regularization terms are added to the objective function. Finally, numerical examples demonstrate the effectiveness of our algorithms.