Change of basis algorithms for surfaces in CAGD

DOI10.1016/0167-8396(94)00040-3zbMath0875.68922OpenAlexW2095262691WikidataQ126399757 ScholiaQ126399757MaRDI QIDQ672159

Ronald N. Goldman, Suresh Kumar Lodha

Publication date: 27 February 1997

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8396(94)00040-3

zbMATH Keywords

AlgorithmsDualityPolynomialsCAGDBlossomingChange of basisde Boor evaluationde Boor-Fix formulaHorner evaluationSurfaces

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer science aspects of computer-aided design (68U07)

Related Items (3)

A unified approach to evaluation algorithms for multivariate polynomials ⋮ The apolar bilinear form in geometric modeling ⋮ Lattices and algorithms for bivariate Bernstein, Lagrange, Newton, and other related polynomial bases based on duality between \(L\)-bases and \(B\)-bases

Cites Work

• Unnamed Item
• Unnamed Item
• Symmetric recursive algorithms for surfaces: B-patches and the de Boor algorithm for polynomials over triangles
• Efficient evaluation of multivariate polynomials
• Spline approximation by quasiinterpolants
• On calculating with B-splines
• Blossoming Begets B-Spline Bases Built Better by B-Patches

This page was built for publication: Change of basis algorithms for surfaces in CAGD