Extrapolating acceleration algorithms for finding \(B\)-spline intersections using recursive subdivision techniques (Q1322394)

From MaRDI portal
Revision as of 14:34, 22 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Extrapolating acceleration algorithms for finding \(B\)-spline intersections using recursive subdivision techniques
scientific article

    Statements

    Extrapolating acceleration algorithms for finding \(B\)-spline intersections using recursive subdivision techniques (English)
    0 references
    0 references
    0 references
    0 references
    4 July 1994
    0 references
    The authors give a matrix formulation and implementation of the de Casteljau algorithm and combine it with a type of Aitken acceleration to obtain a reasonably efficient method to compute the intersection of two Bézier-spline surfaces by subdividing until the surfaces are locally plane and can be intersected by linear methods.
    0 references
    recursive subdivision
    0 references
    de Casteljau algorithm
    0 references
    Aitken acceleration
    0 references
    intersection of two Bézier-spline surfaces
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references