Triangular Berstein-Be´zier patches
Computer Aided Geometric Design
Fundamentals of computer aided geometric design
Fundamentals of computer aided geometric design
Computer Aided Geometric Design - Special issue dedicated to Paul de Faget de Casteljau
Least squares approximation of Bézier coefficients provides best degree reduction in the L2-norm
Journal of Approximation Theory
Curves and Surfaces for Computer-Aided Geometric Design: A Practical Code
Curves and Surfaces for Computer-Aided Geometric Design: A Practical Code
Numerical Computations, Volume II
Numerical Computations, Volume II
Optimal multi-degree reduction of triangular Bézier surfaces with corners continuity in the norm L2
Journal of Computational and Applied Mathematics
Bivariate orthogonal polynomials on triangular domains
Mathematics and Computers in Simulation
Approximating tensor product Bézier surfaces with tangent plane continuity
Journal of Computational and Applied Mathematics
Multi-degree reduction of triangular Bézier surfaces with boundary constraints
Computer-Aided Design
On the degree elevation of Bernstein polynomial representation
Journal of Computational and Applied Mathematics
Constrained multi-degree reduction of triangular Bézier surfaces using dual Bernstein polynomials
Journal of Computational and Applied Mathematics
Multi-degree reduction of Bézier curves using reparameterization
Computer-Aided Design
Linear methods for G1, G2, and G 3-Multi-degree reduction of Bézier curves
Computer-Aided Design
| Hi-index | 7.30 |
The problem of degree reduction and degree raising of triangular Bézier surfaces is considered. The L2 and l2 measures of distance combined with the least-squares method are used to get a formula for the Bézier points. The methods use the matrix representations of the degree reduction and degree raising.