Subdividing Multivariate Polynomials Over Simplices in Bernstein-Bézier Form Without de Casteljau Algorithm

M. Neamtu

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Abstract

    Some possible alternatives to the “classical” subdivision of Bernstein polynomials (i.e., based on utilizing the well known de Casteljau algorithm), are sketched. Our schemes have “asymptotically” lower computational complexities and can be carried out such that the resulting “control points” take the precise values of the polynomial surface being subdivided. For one particular approach, the so called discrete Bernstein basis polynomials are introduced.
    Original languageEnglish
    Title of host publicationCurves and Surfaces
    EditorsPierre-Jean Laurent, Alain Le Méhauté, Larry L. Schumaker
    PublisherAcademic Press
    Pages359-362
    Number of pages4
    ISBN (Print)978-0-12-438660-0
    DOIs
    Publication statusPublished - 1991

    Fingerprint

    Dive into the research topics of 'Subdividing Multivariate Polynomials Over Simplices in Bernstein-Bézier Form Without de Casteljau Algorithm'. Together they form a unique fingerprint.

    Cite this