Robust arithmetic for multivariate Bernstein-form polynomials

DOI10.1016/S0010-4485(00)00056-7zbMATH Open1206.65268OpenAlexW2011906636MaRDI QIDQ628010FDOQ628010

J. Berchtold, Adrian Bowyer

Publication date: 4 March 2011

Published in: CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0010-4485(00)00056-7

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Computer science aspects of computer-aided design (68U07) Software, source code, etc. for problems pertaining to special functions (33-04)

Cited In (11)

• On the degree elevation of Bernstein polynomial representation
• An efficient algorithm for range computation of polynomials using the Bernstein form
• Robust plotting of generalized lemniscates
• Comparison of interval methods for plotting algebraic curves
• Multiplication-free evaluation of polynomials via a stochastic Bernstein representation
• Uniform approximation and Bernstein polynomials with coefficients in the unit interval
• Gauss map computation for free-form surfaces
• Approximation of multivariate function by using new multivariate Bernstein \(\alpha\)-polynomials
• The Bernstein polynomial basis: a centennial retrospective
• The mixed directional difference-summation algorithm for generating the Bézier net of a trivariate four-direction box-spline
• Title not available (Why is that?)

This page was built for publication: Robust arithmetic for multivariate Bernstein-form polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628010)