Multi-degree reduction of tensor product Bézier surfaces with general boundary constraints (Q621006)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Multi-degree reduction of tensor product Bézier surfaces with general boundary constraints
scientific article

    Statements

    Multi-degree reduction of tensor product Bézier surfaces with general boundary constraints (English)
    0 references
    0 references
    0 references
    2 February 2011
    0 references
    An efficient approach to solving a multi-degree reduction of rectangular Bézier patches with a prescribed boundary subset of control points is proposed. The suggested solution is based on the continuity conditions for any two adjacent Bézier patches. These continuity conditions are given in terms of control points close to their common boundary control polygon. The presented method of \(C^r\) continuity preserving multi-degree reduction of rectangular Bézier patches is given in terms of constrained bivariate dual Bernstein polynomials. An algorithmic implementation of the suggested method is presented in detail and several examples with restriction on \(C^0\) and \(C^1\) continuity preserving are shown. The given method can be used in computer aided geometric design where degree reduction of a Bézier curves and surfaces is one of the important problems.
    0 references
    rectangular Bézier patch
    0 references
    multi-degree reduction
    0 references
    continuity
    0 references
    boundary conditions
    0 references
    Bernstein polynomials
    0 references
    constrained dual Bernstein polynomials
    0 references
    Jacobi polynomials
    0 references
    Hahn polynomials
    0 references
    numerical examples
    0 references
    algorithm
    0 references
    control points
    0 references
    boundary control polygon
    0 references
    computer aided geometric design
    0 references
    Bézier curves and surfaces
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers