×

The Bernstein polynomial basis: a centennial retrospective. (English) Zbl 1252.65039

One hundred years after the introduction of the Bernstein polynomial basis, we survey the historical development and current state of theory, algorithms, and applications associated with this remarkable method of representing polynomials over finite domains. Originally introduced by Sergei Natanovich Bernstein to facilitate a constructive proof of the Weierstrass approximation theorem, the leisurely convergence rate of Bernstein polynomial approximations to continuous functions caused them to languish in obscurity, pending the advent of digital computers.
With the desire to exploit the power of computers for geometric design applications, however, the Bernstein form began to enjoy widespread use as a versatile means of intuitively constructing and manipulating geometric shapes, spurring further development of basic theory, simple and efficient recursive algorithms, recognition of its excellent numerical stability properties, and an increasing diversification of its repertoire of applications. This survey provides a brief historical perspective on the evolution of the Bernstein polynomial basis, and a synopsis of the current state of associated algorithms and applications.

MSC:

65D17 Computer-aided design (modeling of curves and surfaces)
65-03 History of numerical analysis
41A10 Approximation by polynomials

Software:

BPOLY
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Ackermann, J., Robust Control: Systems with Uncertain Physical Parameters (1993), Springer: Springer London
[2] Ainsworth, M.; Adriamaro, G.; Davydov, O., Bernstein-Bézier finite elements of arbitrary order and optimal assembly procedures, SIAM Journal on Scientific Computing, 33, 3087-3109 (2011) · Zbl 1237.65120
[3] Ait-Haddou, R.; Herzog, W.; Nomura, T., Complex Bézier curves and the geometry of polygons, Computer Aided Geometric Design, 27, 525-537 (2010) · Zbl 1217.68233
[4] Akhiezer, N.I., 1955. Akademik S.N. Bernshtein i ego raboty po konstruktivnoy teorii funktsy (The academician S.N. Bernstein and his contributions to constructive function theory), Kharkov — translated into German by R.K. Kovacheva and H.H. Gonska as Das Akademiemitglied S.N. Bernstein und seine Arbeiten zur konstruktiven Funktionentheorie, Giessen (2000).; Akhiezer, N.I., 1955. Akademik S.N. Bernshtein i ego raboty po konstruktivnoy teorii funktsy (The academician S.N. Bernstein and his contributions to constructive function theory), Kharkov — translated into German by R.K. Kovacheva and H.H. Gonska as Das Akademiemitglied S.N. Bernstein und seine Arbeiten zur konstruktiven Funktionentheorie, Giessen (2000).
[5] Alfeld, P.; Neamtu, M.; Schumaker, L. L., Bernstein-Bézier polynomials on spheres and sphere-like surfaces, Computer Aided Geometric Design, 13, 333-349 (1996) · Zbl 0875.68863
[6] Akyar, H.; Büyükköroǧlu, T.; Dzhafarov, V., On stability of parameterized families of polynomials and matrices, Abstract and Applied Analysis (2010), Article No. 687951
[7] Arnold, D. N.; Falk, R. S.; Winther, R., Geometric decompositions and local bases for spaces of finite element differential forms, Computer Methods in Applied Mechanics and Engineering, 198, 1660-1672 (2009) · Zbl 1227.65091
[8] Barmish, B. R., New Tools for Robustness of Linear Systems (1994), Macmillan: Macmillan New York · Zbl 1094.93517
[9] Berchtold, J.; Bowyer, A., Robust arithmetic for multivariate Bernstein-form polynomials, Computer Aided Design, 32, 681-689 (2000) · Zbl 1206.65268
[10] Bernstein, S. N., Démonstration du théorème de Weierstrass fondée sur le calcul des probabilités, Communications de la Société Mathématique de Kharkov 2. Series, XIII, 1, 1-2 (1912) · JFM 43.0301.03
[11] Bézier, P., Définition numérique des courbes et surfaces I, Automatisme, XI, 625-632 (1966)
[12] Bézier, P., Définition numérique des courbes et surfaces II, Automatisme, XII, 17-21 (1967)
[13] Bézier, P., Example of an existing system in the motor industry: The UNISURF system, Proceedings of the Royal Society of London A, 321, 207-218 (1971)
[14] Bézier, P., Numerical Control: Mathematics and Applications (1972), Wiley: Wiley London, (translated by A.R. Forrest, A.F. Pankhurst) · Zbl 0251.93002
[15] Bézier, P., Mathematical and practical possibilities of UNISURF, (Barnhill, R. E.; Riesenfeld, R. F., Computer Aided Geometric Design (1974), Academic Press: Academic Press New York), 127-152
[16] Bézier, P., 1977. Essai de Définition Numérique des Courbes et des Surfaces Expérimentales. PhD Thesis, University of Paris VI.; Bézier, P., 1977. Essai de Définition Numérique des Courbes et des Surfaces Expérimentales. PhD Thesis, University of Paris VI.
[17] Bézier, P., The Mathematical Basis of the UNISURF CAD System (1986), Butterworths: Butterworths London
[18] Bézier, P. E., The first years of CAD/CAM and the UNISURF CAD system, (Piegl, L., Fundamental Developments of Computer-Aided Geometric Modeling (1993), Academic Press: Academic Press London), 13-26
[19] Bini, D. A.; Gemignani, L., Bernstein-Bezoutian matrices, Theoretical Computer Science, 315, 319-333 (2004) · Zbl 1071.65014
[20] Bini, D. A.; Gemignani, L.; Winkler, J. R., Structured matrix methods for CAGD: An application to computing the resultant of polynomials in the Bernstein basis, Numerical Linear Algebra with Applications, 12, 685-698 (2005) · Zbl 1164.65314
[21] Boehm, W., On de Boor-like algorithms and blossoming, Computer Aided Geometric Design, 5, 71-79 (1988) · Zbl 0657.65015
[22] Boehm, W.; Müller, A., On de Casteljauʼs algorithm, Computer Aided Geometric Design, 16, 587-605 (1999) · Zbl 0997.65017
[23] Bogdanovich, A. E., Three-dimensional variational theory of laminated composite plates and its implementation with Bernstein basis functions, Computer Methods in Applied Mechanics and Engineering, 185, 279-304 (2000) · Zbl 0985.74015
[24] Bogdanovich, A. E., Three-dimensional variational analysis of composite structures using Bernstein polynomial approximations, Reports 1 & 2, Mechanics of Composite Materials, 37, 525-538 (2001), 539-552
[25] Bogdanovich, A. E.; Pastore, C. M.; Deepak, B. P., A comparison of various 3D approaches for the analysis of laminated composite structures, Composites Engineering, 5, 1105-1126 (1995)
[26] Bogdanovich, A. E.; Yushanov, S. P., Progressive failure analysis of adhesive bonded joints with laminated composite adherends, Journal of Reinforced Plastics and Composites, 18, 1689-1707 (1999)
[27] Böhm, W., Über die Konstruktion von B-Spline-Kurven, Computing, 18, 161-166 (1977) · Zbl 0361.65009
[28] Böhm, W.; Farin, G.; Kahmann, J., A survey of curve and surface methods in CAGD, Computer Aided Geometric Design, 1, 1-60 (1984) · Zbl 0604.65005
[29] Boyd, J. P., Exploiting parity in converting to and from Bernstein polynomials and orthogonal polynomials, Applied Mathematics and Computation, 198, 925-929 (2008) · Zbl 1138.65024
[30] Braun, J.; Sambridge, M., A numerical method for solving partial differential equations on highly irregular evolving grids, Nature, 376, 655-660 (1995)
[31] Brunnett, G.; Schreiber, T.; Braun, J., The geometry of optimal degree reduction of Bézier curves, Computer Aided Geometric Design, 13, 773-788 (1996) · Zbl 0875.68882
[32] Burnside, W. S.; Panton, A. W., The Theory of Equations (1928), Dover Publications: Dover Publications New York, (reprint) · JFM 36.0135.02
[33] Busé, L.; Goldman, R., Division algorithms for Bernstein polynomials, Computer Aided Geometric Design, 25, 850-865 (2008) · Zbl 1172.33304
[34] Cargo, G. T.; Shisha, O., The Bernstein form of a polynomial, Journal of Research of the National Bureau of Standards — B. Mathematics and Mathematical Physics, 70B, 79-81 (1966) · Zbl 0139.10003
[35] Carnicer, J. M.; Peña, J. M., Shape preserving representations and optimality of the Bernstein basis, Advances in Computational Mathematics, 1, 173-196 (1993) · Zbl 0832.41013
[36] Chang, G., Bernstein polynomials via the shifting operator, American Mathematical Monthly, 91, 634-638 (1984) · Zbl 0563.41007
[37] Chang, G.; Wu, J., Mathematical foundations of Bézierʼs technique, Computer Aided Design, 13, 133-136 (1981)
[38] Charrot, P.; Gregory, J. A., A pentagonal surface patch for computer aided geometric design, Computer Aided Geometric Design, 1, 87-94 (1984) · Zbl 0568.65007
[39] Cohen, E.; Schumaker, L. L., Rates of convergence of control polygons, Computer Aided Geometric Design, 2, 229-235 (1985) · Zbl 0597.65003
[40] Coluccio, L.; Eisinberg, A.; Fedele, G., Gauss-Lobatto to Bernstein polynomials transformation, Journal of Computational and Applied Mathematics, 222, 690-700 (2008) · Zbl 1157.65013
[41] Crowe, M. J., A History of Vector Analysis (1967), Dover Publications: Dover Publications New York, (reprint) · Zbl 0165.00303
[42] Cheney, E. W., Introduction to Approximation Theory (1966), McGraw-Hill: McGraw-Hill New York · Zbl 0161.25202
[43] Dahmen, W., Subdivision algorithms converge quadratically, Journal of Computational and Applied Mathematics, 16, 145-158 (1986) · Zbl 0596.65003
[44] Daniel, M.; Daubisse, J. C., The numerical problem of using Bézier curves and surfaces in the power basis, Computer Aided Geometric Design, 6, 121-128 (1989) · Zbl 0665.65013
[45] Dasgupta, G., Interpolants within convex polygons: Wachspress shape functions, Journal of Aerospace Engineering, 16, 1-8 (2003)
[46] Davis, P. J., Interpolation and Approximation (1975), Dover Publications: Dover Publications New York, (reprint) · Zbl 0111.06003
[47] de Boor, C., Cutting corners always works, Computer Aided Geometric Design, 4, 125-131 (1987) · Zbl 0637.41014
[48] de Boor, C., B-form basics, (Farin, G. E., Geometric Modeling: Algorithms and New Trends (1987), SIAM: SIAM Philadelphia), 131-148
[49] de Boor, C., A Practical Guide to Splines (2001), Springer: Springer New York · Zbl 0987.65015
[50] de Boor, C.; Höllig, K., B-splines without divided differences, (Farin, G. E., Geometric Modeling: Algorithms and New Trends (1987), SIAM: SIAM Philadelphia), 21-27
[51] de Casteljau, P., 1963. Courbes et Surfaces à Pôles. Société Anonyme André Citroën, Internal Report.; de Casteljau, P., 1963. Courbes et Surfaces à Pôles. Société Anonyme André Citroën, Internal Report.
[52] de Casteljau, P., Formes à Pôles (1985), Hermès: Hermès Paris
[53] de Casteljau, P., Shape Mathematics and CAD (1986), Kogan-Page: Kogan-Page London
[54] de Casteljau, P., Les Quaternions (1987), Hermès: Hermès Paris · Zbl 0656.15009
[55] de Casteljau, P., POLynomials, POLar forms, and interPOLation, (Lyche, T.; Schumaker, L. L., Mathematical Methods in Computer Aided Geometric Design II (1991), Academic Press: Academic Press Boston), 57-68
[56] de Casteljau, P., Polar forms for curve and surface modelling as used at Citroën, (Piegl, L., Fundamental Developments of Computer-Aided Geometric Modeling (1993), Academic Press: Academic Press London), 1-11
[57] de Faget de Casteljau, P., De Casteljauʼs autobiography: My time at Citroën, Computer Aided Geometric Design, 16, 583-586 (1999) · Zbl 0989.01512
[58] Delgado, J.; Peña, J. M., Optimal conditioning of Bernstein collocation matrices, SIAM Journal on Matrix Analysis and Applications, 31, 990-996 (2009) · Zbl 1213.65072
[59] DeRose, T. D., Composing Bézier simplexes, ACM Transactions on Graphics, 7, 198-221 (1988) · Zbl 0657.65027
[60] Dorf, R. C.; Bishop, R. H., Modern Control Systems (2005), Pearson Prentice Hall: Pearson Prentice Hall Upper Saddle River, NJ
[61] Duffy, M. G., Quadrature over a pyramid or cube of integrands with a singularity at a vertex, SIAM Journal on Numerical Analysis, 19, 1260-1262 (1982) · Zbl 0493.65011
[62] Dyken, C.; Floater, M. S., Transfinite mean value interpolation, Computer Aided Geometric Design, 26, 117-134 (2009) · Zbl 1205.65034
[63] Dzhafarov, V.; Büyükköroǧlu, T.; Esen, O., On different types of stability of linear polytopic systems, Proceedings of the Steklov Institute of Mathematics, 269, 66-74 (2010) · Zbl 1226.93108
[64] Eck, M., Degree reduction of Bézier curves, Computer Aided Geometric Design, 10, 237-251 (1993) · Zbl 0786.65016
[65] Eck, M., Least squares degree reduction of Bézier curves, Computer Aided Design, 27, 845-851 (1995)
[66] Eck, M., DeRose, T.D., Duchamp, T., Hoppe, H., Lounsbery, M., Stuetzle, W., 1995. Multiresolution analysis of arbitrary meshes In: Proceedings of SIGGRAPH 95, pp. 173-182.; Eck, M., DeRose, T.D., Duchamp, T., Hoppe, H., Lounsbery, M., Stuetzle, W., 1995. Multiresolution analysis of arbitrary meshes In: Proceedings of SIGGRAPH 95, pp. 173-182.
[67] Epperson, J. F., On the Runge example, American Mathematical Monthly, 94, 329-341 (1987) · Zbl 0636.41004
[68] Ernesto, C. A.; Farouki, R. T., High-speed cornering by CNC machines under prescribed bounds on axis accelerations and toolpath contour error, International Journal of Advanced Manufacturing Technology, 58, 327-338 (2012)
[69] Farin, G. E., Algorithms for rational Bézier curves, Computer Aided Design, 15, 73-77 (1983)
[70] Farin, G. E., Triangular Bernstein-Bézier patches, Computer Aided Geometric Design, 3, 83-127 (1986)
[71] Farin, G., Curvature continuity and offsets for piecewise conics, ACM Transactions on Graphics, 8, 89-99 (1989) · Zbl 0746.68092
[72] Farin, G. E., Surfaces over Dirichlet tessellations, Computer Aided Geometric Design, 7, 281-292 (1990) · Zbl 0728.65013
[73] Farin, G. E., Curves and Surfaces for CAGD: A Practical Guide (2002), Morgan Kaufmann: Morgan Kaufmann San Francisco
[74] Farin, G.; Piper, B.; Worsey, A., The octant of a sphere as a non-degenerate triangular Bézier patch, Computer Aided Geometric Design, 4, 329-332 (1987) · Zbl 0646.41011
[75] Farouki, R. T., On the stability of transformations between power and Bernstein polynomial forms, Computer Aided Geometric Design, 8, 29-36 (1991) · Zbl 0725.65018
[76] Farouki, R. T., Computing with barycentric polynomials, The Mathematical Intelligencer, 13, 61-69 (1991) · Zbl 0746.65011
[77] Farouki, R. T., The conformal map \(z \to z^2\) of the hodograph plane, Computer Aided Geometric Design, 11, 363-390 (1994) · Zbl 0806.65005
[78] Farouki, R. T., Legendre-Bernstein basis transformations, Journal of Computational and Applied Mathematics, 119, 145-160 (2000) · Zbl 0962.65042
[79] Farouki, R. T., Pythagorean-Hodograph Curves: Algebra and Geometry Inseparable (2008), Springer: Springer Berlin · Zbl 1144.51004
[80] Farouki, R. T.; Chastang, J.-C. A., Curves and surfaces in geometrical optics, (Lyche, T.; Schumaker, L. L., Mathematical Methods in Computer Aided Geometric Design II (1991), Academic Press: Academic Press Boston), 239-260
[81] Farouki, R. T.; Goodman, T. N.T., On the optimal stability of the Bernstein basis, Mathematics of Computation, 65, 1553-1566 (1996) · Zbl 0853.65051
[82] Farouki, R. T.; Neff, C. A., On the numerical condition of Bernstein-Bézier subdivision processes, Mathematics of Computation, 55, 637-647 (1990) · Zbl 0749.65008
[83] Farouki, R. T.; Rajan, V. T., On the numerical condition of polynomials in Bernstein form, Computer Aided Geometric Design, 4, 191-216 (1987) · Zbl 0636.65012
[84] Farouki, R. T.; Rajan, V. T., Algorithms for polynomials in Bernstein form, Computer Aided Geometric Design, 5, 1-26 (1988) · Zbl 0648.65007
[85] Farouki, R. T.; Tsai, Y.-F.; Wilson, C. S., Physical constraints on feedrates and feed accelerations along curved tool paths, Computer Aided Geometric Design, 17, 337-359 (2000) · Zbl 0938.68126
[86] Feller, W., An Introduction to Probability Theory and its Applications, vol. 1 (1950), Wiley: Wiley New York · Zbl 0039.13201
[87] Floater, M. S., Mean value coordinates, Computer Aided Geometric Design, 20, 19-27 (2003) · Zbl 1069.65553
[88] Floater, M. S., On the convergence of derivatives of Bernstein approximation, Journal of Approximation Theory, 134, 130-135 (2005) · Zbl 1068.41010
[89] Floater, M. S.; Hormann, K.; Kós, G., A general construction of barycentric coordinates over convex polygons, Advances in Computational Mathematics, 24, 311-331 (2006) · Zbl 1095.65016
[90] Forrest, A. R., Interactive interpolation and approximation by Bézier polynomials, The Computer Journal, 15, 71-79 (1972) · Zbl 0243.68015
[91] Fünfzig, C.; Michelucci, D.; Foufou, S., Polytope-based computation of polynomial ranges, Computer Aided Geometric Design, 29, 18-29 (2012) · Zbl 1244.65071
[92] Garloff, J., Application of Bernstein expansion to the solution of control problems, Reliable Computing, 6, 303-320 (2000) · Zbl 0965.65095
[93] Garloff, J.; Graf, B., Robust Schur stability of polynomials with polynomial parameter dependency, Multidimensional Systems and Signal Processing, 10, 189-199 (1999) · Zbl 0940.93055
[94] Garloff, J.; Jansson, C.; Smith, A. P., Lower bound functions for polynomials, Journal of Computational and Applied Mathematics, 157, 207-225 (2003) · Zbl 1032.65055
[95] Garloff, J.; Smith, A. P., Investigation of a subdivision based algorithm for solving systems of polynomial equations, Nonlinear Analysis, 47, 167-178 (2001) · Zbl 1042.65526
[96] Gautschi, W., On the condition of algebraic equations, Numerische Mathematik, 21, 405-424 (1973) · Zbl 0278.65044
[97] Gautschi, W., Questions of numerical condition related to polynomials, (Golub, G. H., Studies in Numerical Analysis. Studies in Numerical Analysis, MAA Studies in Mathematics, vol. 24 (1984)), 140-177 · Zbl 0584.65020
[98] Goetgheluck, P., Computing binomial coefficients, American Mathematical Monthly, 94, 360-365 (1987) · Zbl 0617.05004
[99] Goetgheluck, P., On prime divisors of binomial coefficients, Mathematics of Computation, 51, 325-329 (1988) · Zbl 0673.10012
[100] Goldman, R. N., Markov chains and computer-aided geometric design: Part I — problems and constraints, ACM Transactions on Graphics, 3, 204-222 (1984) · Zbl 0592.68081
[101] Goldman, R. N., Markov chains and computer-aided geometric design: Part II — examples and subdivision matrices, ACM Transactions on Graphics, 4, 12-40 (1985) · Zbl 0614.68080
[102] Goldman, R. N., Polyaʼs urn model and computer aided geometric design, SIAM Journal on Algebraic and Discrete Methods, 6, 1-28 (1985) · Zbl 0602.68103
[103] Goldman, R., Pyramid Algorithms: A Dynamic Programming Approach to Curves and Surfaces for Geometric Modeling (2003), Morgan Kaufmann: Morgan Kaufmann San Francisco
[104] Goldman, R. N.; Sederberg, T. W.; Anderson, D. C., Vector elimination: A technique for the implicitization, inversion, and intersection of planar parametric rational polynomial curves, Computer Aided Geometric Design, 1, 327-356 (1984) · Zbl 0571.65114
[105] Goodman, T. N.T., Shape preserving representations, (Lyche, T.; Schumaker, L. L., Mathematical Methods in Computer Aided Geometric Design (1989), Academic Press: Academic Press Boston), 333-351 · Zbl 0693.41027
[106] Gordon, W. J.; Riesenfeld, R. F., Bernstein-Bézier methods for the computer-aided design of free-form curves and surfaces, Journal of the Association for Computing Machinery, 21, 293-310 (1974) · Zbl 0276.68041
[107] Gregory, J. A., \(N\)-sided surface patches, (Gregory, J. A., The Mathematics of Surfaces (1986), Clarendon Press: Clarendon Press Oxford), 217-232
[108] Henrici, P., Elements of Numerical Analysis (1964), Wiley: Wiley New York · Zbl 0149.10901
[109] Hermann, T., On the stability of polynomial transformations between Taylor, Bézier, and Hermite forms, Numerical Algorithms, 13, 307-320 (1996) · Zbl 0869.65030
[110] Ho, T.-S.; Rabitz, H., Proper construction of ab initio global potential surfaces with accurate long-range interactions, Journal of Chemical Physics, 113, 3960-3968 (2000)
[111] Hong, X.; Harris, C. J., Generalized neurofuzzy network modeling algorithms using Bézier-Bernstein polynomial functions and additive decomposition, IEEE Transactions on Neural Networks, 11, 889-902 (2000)
[112] Hormann, K.; Floater, M. S., Mean value coordinates for arbitrary planar polygons, ACM Transactions on Graphics, 25, 1424-1441 (2006)
[113] Hormann, K.; Sukumar, N., Maximum entropy coordinates for arbitrary polytopes, Computer Graphics Forum, 27, 1513-1520 (2008)
[114] Hosaka, M., Kimura, F., 1978. Synthesis methods of curves and surfaces in interactive CAD, in: Proceedings, Interactive Techniques in CAD, Bologna, pp. 151-156.; Hosaka, M., Kimura, F., 1978. Synthesis methods of curves and surfaces in interactive CAD, in: Proceedings, Interactive Techniques in CAD, Bologna, pp. 151-156.
[115] Hosaka, M.; Kimura, F., Non-four-sided patch expressions with control points, Computer Aided Geometric Design, 1, 75-86 (1984) · Zbl 0581.65009
[116] Hoschek, J.; Lasser, D., Fundamentals of Computer-Aided Geometric Design (1993), AK Peters, Translated from German by L.L. Schumaker · Zbl 0788.68002
[117] Hughes, T. J.R.; Cottrell, J. A.; Bazilevs, Y., Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement, Computer Methods in Applied Mechanics and Engineering, 194, 4135-4195 (2005) · Zbl 1151.74419
[118] Isaacson, E.; Keller, H. B., Analysis of Numerical Methods (1994), Dover: Dover New York · Zbl 0168.13101
[119] Jüttler, B., The dual basis functions for the Bernstein polynomials, Advances in Computational Mathematics, 8, 345-352 (1998) · Zbl 0913.41004
[120] Kiciak, P.; Zidna, A., Recursive de Casteljau bisection and rounding errors, Computer Aided Geometric Design, 21, 683-695 (2004) · Zbl 1069.65573
[121] Kirby, R. C., Fast simplicial finite element algorithms using Bernstein polynomials, Numerische Mathematik, 117, 631-652 (2011) · Zbl 1211.65156
[122] Kirby, R.C., Thinh, K.T., 2012. Fast simplicial quadrature-based finite element operators using Bernstein polynomials. Numerische Mathematik, in press, doi:10.1007/s00211-011-0431-y; Kirby, R.C., Thinh, K.T., 2012. Fast simplicial quadrature-based finite element operators using Bernstein polynomials. Numerische Mathematik, in press, doi:10.1007/s00211-011-0431-y · Zbl 1247.65147
[123] Knopf, G. K.; Kofman, J., Free-form surface reconstruction using Bernstein basis function networks, (Intelligent Engineering Systems through Artificial Neural Networks, vol. 9 (1999), ASME), 797-802
[124] Knopf, G. K.; Kofman, J., Surface reconstruction using neural network mapping of range-sensor images to object space, Journal of Electronic Imaging, 11, 187-194 (2002)
[125] Korovkin, P. P., Linear Operators and Approximation Theory (1960), Hindustan Publishing Corporation: Hindustan Publishing Corporation Delhi, (translated from Russian) · Zbl 0094.10201
[126] Krasauskas, R., Toric surface patches, Advances in Computational Mathematics, 17, 89-113 (2002) · Zbl 0997.65027
[127] Krautter, J.; Parizot, S., Système dʼaide à la définition et à lʼusinage des surfaces de carosserie, Journal de la Société des Ingénieurs de lʼAutomobile, 44, 581-586 (1971)
[128] Lachance, M. A., Chebyshev economization for parametric surfaces, Computer Aided Geometric Design, 5, 195-208 (1988) · Zbl 0709.65012
[129] Lai, M. J.; Schumaker, L. L., Spline Functions on Triangulations (2007), Cambridge University Press: Cambridge University Press Cambridge · Zbl 1185.41001
[130] Lane, J. M.; Riesenfeld, R. F., A theoretical development for the computer generation and display of piecewise polynomial surfaces, IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-2, 35-46 (1980) · Zbl 0436.68063
[131] Lane, J. M.; Riesenfeld, R. F., Bounds on a polynomial, BIT, 21, 112-117 (1981) · Zbl 0472.65041
[132] Laurent, P.-J.; Sablonnière, P., Pierre Bézier: An engineer and a mathematician, Computer Aided Geometric Design, 18, 609-617 (2001) · Zbl 1024.01515
[133] Li, Y.-M.; Zhang, X.-Y., Basis conversion among Bézier, Tchebyshev, and Legendre, Computer Aided Geometric Design, 15, 637-642 (1998) · Zbl 0905.68145
[134] Loop, C. T.; DeRose, T. D., A multi-sided generalization of Bézier surfaces, ACM Transactions on Graphics, 8, 204-234 (1989) · Zbl 0746.68097
[135] Lorentz, G. G., Bernstein Polynomials (1953), University of Toronto Press · Zbl 0051.05001
[136] Lutterkort, D.; Peters, J.; Reif, U., Polynomial degree reduction in the \(L_2\)-norm equals best Euclidean approximation of Bézier coefficients, Computer Aided Geometric Design, 16, 607-612 (1999) · Zbl 0993.41016
[137] Malan, S.; Milanese, M.; Taragna, M., Robust analysis and design of control systems using interval arithmetic, Automatica, 33, 1363-1372 (1997) · Zbl 0890.93034
[138] Malsch, E. A.; Dasgupta, G., Shape functions for polygonal domains with interior nodes, International Journal for Numerical Methods in Engineering, 61, 1153-1172 (2004) · Zbl 1073.65564
[139] Malsch, E. A.; Lin, J. J.; Dasgupta, G., Smooth two dimensional interpolants: A recipe for all polygons, Journal of Graphics Tools, 10, 27-39 (2005)
[140] Marco, A.; Martínez, J.-J., A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems, Linear Algebra and its Applications, 422, 616-628 (2007) · Zbl 1116.65038
[141] Marco, A.; Martínez, J.-J., Polynomial least squares fitting in the Bernstein basis, Linear Algebra and its Applications, 433, 1254-1264 (2010) · Zbl 1202.65017
[142] Mazure, M.-L., Blossoms and optimal bases, Advances in Computational Mathematics, 20, 177-203 (2004) · Zbl 1042.65016
[143] Meyer, M.; Lee, H.; Barr, A.; Desbrun, M., Generalized barycentric coordinates on irregular polygons, Journal of Graphics Tools, 7, 13-22 (2002) · Zbl 1024.68109
[144] Micchelli, C. A.; Prautzsch, H., Uniform refinement of curves, Linear Algebra and its Applications, 114, 841-870 (1989) · Zbl 0668.65011
[145] Minc, H., Nonnegative Matrices (1988), Wiley: Wiley New York · Zbl 0638.15008
[146] Minimair, M., Basis-independent polynomial division algorithm applied to division in Lagrange and Bernstein basis, (Kapur, D., Computer Mathematics. Computer Mathematics, Lectures Notes in Artificial Intelligence, vol. 5081 (2008), Springer: Springer Berlin), 72-86 · Zbl 1166.68379
[147] Mourrain, B.; Pavone, J. P., Subdivision methods for solving polynomial equations, Journal of Symbolic Computation, 44, 292-306 (2009) · Zbl 1158.13010
[148] Müller, H.; Otte, M., Solving algebraic systems in Bernstein-Bézier representation, (Lecture Notes in Computer Science, vol. 553 (1991), Springer: Springer New York), 161-169 · Zbl 0806.65050
[149] Nairn, D.; Peters, J.; Lutterkort, D., Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon, Computer Aided Geometric Design, 16, 613-631 (1999) · Zbl 0997.65016
[150] Nataraj, P. S.V.; Arounassalame, M., Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm, Journal of Global Optimization, 49, 185-212 (2011) · Zbl 1209.90294
[151] Peña, J. M., B-splines and optimal stability, Mathematics of Computation, 66, 1555-1560 (1997) · Zbl 0890.65011
[152] Peña, J. M., On the optimal stability of bases of univariate functions, Numerische Mathematik, 91, 305-318 (2002) · Zbl 1004.65020
[153] Phillips, G. M., A survey of results on the \(q\)-Bernstein polynomials, IMA Journal of Numerical Analysis, 30, 277-288 (2010) · Zbl 1191.41002
[154] Pinkall, U.; Polthier, K., Computing discrete minimal surfaces and their conjugates, Experimental Mathematics, 2, 15-36 (1993) · Zbl 0799.53008
[155] Pinkus, A., Weierstrass and approximation theory, Journal of Approximation Theory, 107, 1-66 (2000) · Zbl 0968.41001
[156] Powell, M. J.D., Approximation Theory and Methods (1981), Cambridge University Press: Cambridge University Press Cambridge · Zbl 0453.41001
[157] Prautzsch, H.; Boehm, W.; Paluszny, M., Bézier and B-spline Techniques (2002), Springer: Springer Berlin · Zbl 1033.65008
[158] Prautzsch, H.; Kobbelt, L., Convergence of subdivision and degree elevation, Advances in Computational Mathematics, 2, 143-154 (1994) · Zbl 0829.65012
[159] Preparata, F. P.; Shamos, M. I., Computational Geometry: An Introduction (1985), Springer: Springer New York · Zbl 0575.68059
[160] Rababah, A., Transformation of Chebyshev-Bernstein polynomial basis, Computational Methods in Applied Mathematics, 3, 608-622 (2003) · Zbl 1046.41005
[161] Rababah, A., Jacobi-Bernstein basis transformations, Computational Methods in Applied Mathematics, 4, 206-214 (2004) · Zbl 1071.41006
[162] Rababah, A.; al-Natour, M., The weighted dual functionals for the univariate Bernstein basis, Applied Mathematics and Computation, 186, 1581-1590 (2007) · Zbl 1123.41014
[163] Rabut, C., On Pierre Bézierʼs life and motivations, Computer Aided Design, 34, 493-510 (2002) · Zbl 1206.65004
[164] Ramshaw, L., 1987. Blossoming: A connect-the-dots approach to splines. Digital Equipment Corporation, SRC Report No. 19.; Ramshaw, L., 1987. Blossoming: A connect-the-dots approach to splines. Digital Equipment Corporation, SRC Report No. 19.
[165] Ramshaw, L., Blossoms are polar forms, Computer Aided Geometric Design, 6, 323-358 (1989) · Zbl 0705.65008
[166] Ray, S.; Nataraj, P. S.V., An efficient algorithm for range computation of polynomials using the Bernstein form, Journal of Global Optimization, 45, 403-426 (2009) · Zbl 1191.90046
[167] Rice, J. R., A theory of condition, SIAM Journal on Numerical Analysis, 3, 287-310 (1966) · Zbl 0143.37101
[168] Rivlin, T. J., Bounds on a polynomial, Journal of Research of the National Bureau of Standards — B. Mathematical Sciences, 74B, 47-54 (1970) · Zbl 0197.34704
[169] Rivlin, T. J., An Introduction to the Approximation of Functions (1981), Dover Publications: Dover Publications New York, (reprint) · Zbl 0189.06601
[170] Samadi, S., Explicit formula for improved filter sharpening polynomial, IEEE Transactions on Signal Processing, 9, 2957-2959 (2000)
[171] Sánchez-Reyes, J., Complex rational Bézier curves, Computer Aided Geometric Design, 26, 865-876 (2009) · Zbl 1205.65104
[172] Schaefer, S.; Ju, T.; Warren, J., A unified, integral construction for coordinates over closed curves, Computer Aided Geometric Design, 24, 481-493 (2007) · Zbl 1171.65312
[173] Schumaker, L. L., Spline Functions: Basic Theory (1981), Wiley: Wiley New York · Zbl 0449.41004
[174] Schumaker, L. L., Computing bivariate splines in scattered data fitting and the finite-element method, Numerical Algorithms, 48, 237-260 (2008) · Zbl 1146.65019
[175] Schwartz, A. J., Subdividing Bézier curves and surfaces, (Farin, G., Geometric Modeling: Algorithms and New Trends (1987), SIAM: SIAM Philadelphia), 55-66
[176] Scott, M. A.; Borden, M. J.; Verhoosel, C. V.; Sederberg, T. W.; Hughes, T. J.R., Isogeometric finite element data structures based on Bézier extraction of T-splines, International Journal for Numerical Methods in Engineering, 88, 126-156 (2011) · Zbl 1242.65243
[177] Sederberg, T. W., Planar piecewise algebraic curves, Computer Aided Geometric Design, 1, 241-255 (1984) · Zbl 0576.65135
[178] Sederberg, T. W., Piecewise algebraic surface patches, Computer Aided Geometric Design, 2, 53-59 (1985) · Zbl 0578.65147
[179] Sederberg, T. W.; Parry, S. R., Free-form deformation of solid geometric models, ACM SIGGRAPH Computer Graphics, 20, 4, 151-160 (1986)
[180] Seidel, H.-P., A new multiaffine approach to B-splines, Computer Aided Geometric Design, 6, 23-32 (1989) · Zbl 0666.65011
[181] Sherbrooke, E. C.; Patrikalakis, N. M., Computation of the solutions of nonlinear polynomial systems, Computer Aided Geometric Design, 10, 379-405 (1993) · Zbl 0817.65035
[182] Sibson, R., A vector identity for the Dirichlet tessellation, Mathematical Proceedings of the Cambridge Philosophical Society, 87, 151-155 (1980) · Zbl 0466.52010
[183] Sibson, R., A brief description of the natural neighbor interpolant, (Barnett, V., Interpolating Multivariate Data (1981), Wiley: Wiley Chichester), 21-36
[184] Šiljak, D. D.; Stipanović, D. M., Robust \(D\)-stability via positivity, Automatica, 35, 1477-1484 (1999) · Zbl 0940.93059
[185] Simeonov, P.; Zafiris, V.; Goldman, R., \(h\)-Blossoming: A new approach to algorithms and identities for \(h\)-Bernstein bases and \(h\)-Bézier curves, Computer Aided Geometric Design, 28, 549-565 (2011) · Zbl 1246.65034
[186] Simeonov, P.; Zafiris, V.; Goldman, R., \(q\)-Blossoming: A new approach to algorithms and identities for \(q\)-Bernstein bases and \(q\)-Bézier curves, Journal of Approximation Theory, 164, 77-104 (2012) · Zbl 1242.65036
[187] Simsek, Y., Construction a new generating function of Bernstein type polynomials, Applied Mathematics and Computation, 218, 1072-1076 (2011) · Zbl 1225.30003
[188] Simsek, Y., 2011b. Functional equations from generating functions: A novel approach to deriving identities for the Bernstein basis functions, preprint.; Simsek, Y., 2011b. Functional equations from generating functions: A novel approach to deriving identities for the Bernstein basis functions, preprint. · Zbl 1297.44002
[189] Simsek, Y., 2011c. Generating functions for the Bernstein polynomials: A unified approach to deriving identities for the Bernstein basis functions, preprint.; Simsek, Y., 2011c. Generating functions for the Bernstein polynomials: A unified approach to deriving identities for the Bernstein basis functions, preprint.
[190] Smith, A. P., Fast construction of constant bound functions for sparse polynomials, Journal of Global Optimization, 43, 445-458 (2009) · Zbl 1168.90011
[191] Spencer, M.R., 1994. Polynomial real root finding in Bernstein form. PhD Dissertation, Brigham Young University, available at: http://hdl.lib.byu.edu/1877/2395; Spencer, M.R., 1994. Polynomial real root finding in Bernstein form. PhD Dissertation, Brigham Young University, available at: http://hdl.lib.byu.edu/1877/2395
[192] Stancu, D. D., Approximation of functions by a new class of linear polynomial operators, Revue Roumaine de Mathématique Pures et Appliquées, 13, 1173-1194 (1968) · Zbl 0167.05001
[193] Stancu, D. D., Approximation of functions by means of a new generalized Bernstein operator, Calcolo, 20, 211-229 (1983) · Zbl 0544.41022
[194] Stark, E. L., Bernstein-Polynome, 1912-1955, (Butzer, P. L.; Sz.-Nagy, B.; Görlich, E., Functional Analysis and Approximation (1981), Birkhäuser: Birkhäuser Basel), 443-461
[195] Steffens, K.-G., The History of Approximation Theory: From Euler to Bernstein (2006), Birkhäuser: Birkhäuser Boston
[196] Stewart, G. W., Introduction to Matrix Computations (1973), Academic Press: Academic Press New York · Zbl 0302.65021
[197] Sukumar, N., Construction of polygonal interpolants: A maximum entropy approach, International Journal for Numerical Methods in Engineering, 61, 2159-2181 (2004) · Zbl 1073.65505
[198] Sukumar, N.; Malsch, E. A., Recent advances in the construction of polygonal finite element interpolants, Archives of Computational Methods in Engineering, 13, 129-163 (2006) · Zbl 1101.65108
[199] Sukumar, N.; Moran, B., \(C^1\) natural neighbor interpolant for partial differential equations, Numerical Methods for Partial Differential Equations, 15, 417-447 (1999) · Zbl 0943.74080
[200] Sukumar, N.; Moran, B.; Belytschko, T., The natural element method in solid mechanics, International Journal for Numerical Methods in Engineering, 43, 839-887 (1998) · Zbl 0940.74078
[201] Sukumar, N.; Tabarraei, A., Conforming polygonal finite elements, International Journal for Numerical Methods in Engineering, 61, 2045-2066 (2004) · Zbl 1073.65563
[202] Szafnicki, B., A unified approach for degree reduction of polynomials in the Bernstein basis. Part I: Real polynomials, Journal of Computational and Applied Mathematics, 142, 287-312 (2002) · Zbl 1002.65024
[203] Tolstov, G. P., Fourier Series (1976), Dover Publications: Dover Publications New York, (reprint, translated from Russian by R.A. Silverman) · Zbl 0487.42001
[204] Tsai, Y.-F.; Farouki, R. T., Algorithm 812: BPOLY: An object-oriented library of numerical algorithms for polynomials in Bernstein form, ACM Transactions on Mathematical Software, 27, 267-296 (2001) · Zbl 1070.65515
[205] Uspensky, J. V., Theory of Equations (1948), McGraw-Hill: McGraw-Hill New York · Zbl 0005.11104
[206] Voronowskaja, E., Détermination de la forme asymptotique dʼapproximation des fonctions par les polynômes de M. Bernstein, Doklady Akademii Nauk SSSR, 1932, 79-85 (1932) · JFM 58.1062.04
[207] Wachspress, E. L., A Rational Finite Element Basis (1975), Academic Press: Academic Press New York · Zbl 0479.41012
[208] Wachspress, E. L., Barycentric coordinates for polytopes, Computers and Mathematics with Applications, 61, 3319-3321 (2011) · Zbl 1222.65127
[209] Warren, J., Creating multisided rational Bézier surfaces using base points, ACM Transactions on Graphics, 11, 127-139 (1992) · Zbl 0760.65019
[210] Warren, J., Barycentric coordinates for convex polytopes, Advances in Computational Mathematics, 6, 97-108 (1996) · Zbl 0873.52013
[211] Warren, J.; Schaefer, S.; Hirani, A. N.; Desbrun, M., Barycentric coordinates for convex sets, Advances in Computational Mathematics, 27, 319-338 (2007) · Zbl 1124.52010
[212] Watkins, M. A.; Worsey, A. J., Degree reduction of Bézier curves, Computer Aided Design, 20, 398-405 (1988) · Zbl 0658.65014
[213] Weierstrass, K., 1885. Über die analytische Darstellbarkeit sogenannter willkürlicher Functionen einer reellen Veränderlichen, Sitzungsberichte der Königlich Preussischen Akademie der Wissenschaften zu Berlin. 1885 (II), pp. 633-639 & 789-805, reproduced in: Mathematische Werke, vol. III, Georg Olms, Hildesheim, pp. 1-37.; Weierstrass, K., 1885. Über die analytische Darstellbarkeit sogenannter willkürlicher Functionen einer reellen Veränderlichen, Sitzungsberichte der Königlich Preussischen Akademie der Wissenschaften zu Berlin. 1885 (II), pp. 633-639 & 789-805, reproduced in: Mathematische Werke, vol. III, Georg Olms, Hildesheim, pp. 1-37.
[214] Wilf, H. S., Generatingfunctionology (1990), Academic Press: Academic Press Boston · Zbl 0689.05001
[215] Wilkinson, J. H., The evaluation of the zeros of ill-conditioned polynomials, Parts I & II, Numerische Mathematik, 1, 150-166 (1959), 167-180 · Zbl 0202.43701
[216] Wilkinson, J. H., Rounding Errors in Algebraic Processes (1963), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ · Zbl 0868.65027
[217] Wilkinson, J. H., The perfidious polynomial, (Golub, G. H., Studies in Numerical Analysis. Studies in Numerical Analysis, MAA Studies in Mathematics, vol. 24 (1984)), 1-28 · Zbl 0601.65028
[218] Winkler, J. R., A resultant matrix for scaled Bernstein polynomials, Linear Algebra and its Applications, 319, 179-191 (2000) · Zbl 0970.12002
[219] Winkler, J. R., A companion matrix resultant for Bernstein polynomials, Linear Algebra and its Applications, 362, 153-175 (2003) · Zbl 1042.15006
[220] Winkler, J. R., The transformation of the companion matrix resultant between the power and Bernstein polynomial bases, Applied Numerical Mathematics, 48, 113-126 (2004) · Zbl 1039.65035
[221] Winkler, J. R., A unified approach to resultant matrices for Bernstein basis polynomials, Computer Aided Geometric Design, 25, 529-541 (2008) · Zbl 1172.65350
[222] Youschkevitch, A. P., Sergey Natanovich Bernstein, (Gillespie, C. C., Dictionary of Scientific Biography. Dictionary of Scientific Biography, Supplement I, vol. XV (1980), Charles Scribnerʼs Sons: Charles Scribnerʼs Sons New York), 22-24
[223] Zettler, M.; Garloff, J., Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion, IEEE Transactions on Automatic Control, 43, 425-431 (1998) · Zbl 0906.93046
[224] Zidna, A.; Michel, D., A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis, Mathematics and Computers in Simulation, 77, 313-323 (2008) · Zbl 1135.65323
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.