The Bernstein polynomial basis: A centennial retrospective

Computer Aided Geometric Design

Volumn 29, Issue 6, 2012, Pages 379-419

  Farouki, Rida T ^a  

^a University of California   (United States)

Author keywords

Bernstein basis; B zier curves and surfaces; Numerical stability; Polynomial algorithms; Polynomial approximation; Weierstrass theorem

Indexed keywords

APPROXIMATION ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; DIGITAL COMPUTERS; STABILITY; SURVEYS;

BERNSTEIN BASIS; BERNSTEIN POLYNOMIAL BASIS; CURVES AND SURFACES; HISTORICAL DEVELOPMENT; HISTORICAL PERSPECTIVE; POLYNOMIAL ALGORITHM; WEIERSTRASS APPROXIMATION THEOREMS; WEIERSTRASS THEOREM;

POLYNOMIAL APPROXIMATION;

EID: 84860383798     PISSN: 01678396     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cagd.2012.03.001     Document Type: Review

References (224)

1. J. Ackermann Robust Control: Systems with Uncertain Physical Parameters 1993 Springer London
2. M. Ainsworth, G. Adriamaro, and O. Davydov Bernstein-Bézier finite elements of arbitrary order and optimal assembly procedures SIAM Journal on Scientific Computing 33 2011 3087 3109
3. R. Ait-Haddou, W. Herzog, and T. Nomura Complex Bézier curves and the geometry of polygons Computer Aided Geometric Design 27 2010 525 537
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).
5. P. Alfeld, M. Neamtu, and L.L. Schumaker Bernstein-Bézier polynomials on spheres and sphere-like surfaces Computer Aided Geometric Design 13 1996 333 349 (Pubitemid 126363004)
6. H. Akyar, T. Büyükköroǧlu, and V. Dzhafarov On stability of parameterized families of polynomials and matrices Abstract and Applied Analysis 2010 Article No. 687951
7. D.N. Arnold, R.S. Falk, and R. Winther Geometric decompositions and local bases for spaces of finite element differential forms Computer Methods in Applied Mechanics and Engineering 198 2009 1660 1672
8. B.R. Barmish New Tools for Robustness of Linear Systems 1994 Macmillan New York
9. J. Berchtold, and A. Bowyer Robust arithmetic for multivariate Bernstein-form polynomials Computer Aided Design 32 2000 681 689
10. S.N. Bernstein 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 1912 1 2
11. P. Bézier Définition numérique des courbes et surfaces I Automatisme XI 1966 625 632
12. P. Bézier Définition numérique des courbes et surfaces II Automatisme XII 1967 17 21
13. P. Bézier Example of an existing system in the motor industry: The UNISURF system Proceedings of the Royal Society of London A 321 1971 207 218
14. P. Bézier Numerical Control: Mathematics and Applications 1972 Wiley London (translated by A.R. Forrest, A.F. Pankhurst)
15. P. Bézier Mathematical and practical possibilities of UNISURF R.E. Barnhill, R.F. Riesenfeld, Computer Aided Geometric Design 1974 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.
17. P. Bézier The Mathematical Basis of the UNISURF CAD System 1986 Butterworths London
18. P.E. Bézier The first years of CAD/CAM and the UNISURF CAD system L. Piegl, Fundamental Developments of Computer-Aided Geometric Modeling 1993 Academic Press London 13 26
19. D.A. Bini, and L. Gemignani Bernstein-Bezoutian matrices Theoretical Computer Science 315 2004 319 333
20. D.A. Bini, L. Gemignani, and J.R. Winkler Structured matrix methods for CAGD: An application to computing the resultant of polynomials in the Bernstein basis Numerical Linear Algebra with Applications 12 2005 685 698 (Pubitemid 41441196)
21. W. Boehm On de Boor-like algorithms and blossoming Computer Aided Geometric Design 5 1988 71 79
22. W. Boehm, and A. Müller On de Casteljau's algorithm Computer Aided Geometric Design 16 1999 587 605 (Pubitemid 30500634)
23. A.E. Bogdanovich Three-dimensional variational theory of laminated composite plates and its implementation with Bernstein basis functions Computer Methods in Applied Mechanics and Engineering 185 2000 279 304
24. A.E. Bogdanovich Three-dimensional variational analysis of composite structures using Bernstein polynomial approximations, Reports 1 & 2 Mechanics of Composite Materials 37 2001 525 538 539-552 (Pubitemid 33390097)
25. A.E. Bogdanovich, C.M. Pastore, and B.P. Deepak A comparison of various 3D approaches for the analysis of laminated composite structures Composites Engineering 5 1995 1105 1126
26. A.E. Bogdanovich, and S.P. Yushanov Progressive failure analysis of adhesive bonded joints with laminated composite adherends Journal of Reinforced Plastics and Composites 18 1999 1689 1707 (Pubitemid 32211644)
27. W. Böhm Über die Konstruktion von B-Spline-Kurven Computing 18 1977 161 166
28. W. Böhm, G. Farin, and J. Kahmann A survey of curve and surface methods in CAGD Computer Aided Geometric Design 1 1984 1 60 (Pubitemid 16494157)
29. J.P. Boyd Exploiting parity in converting to and from Bernstein polynomials and orthogonal polynomials Applied Mathematics and Computation 198 2008 925 929 (Pubitemid 351400756)
30. J. Braun, and M. Sambridge A numerical method for solving partial differential equations on highly irregular evolving grids Nature 376 1995 655 660
31. G. Brunnett, T. Schreiber, and J. Braun The geometry of optimal degree reduction of Bézier curves Computer Aided Geometric Design 13 1996 773 788 (Pubitemid 126371176)
32. W.S. Burnside, and A.W. Panton The Theory of Equations 1928 Dover Publications New York (reprint)
33. L. Busé, and R. Goldman Division algorithms for Bernstein polynomials Computer Aided Geometric Design 25 2008 850 865
34. G.T. Cargo, and O. Shisha The Bernstein form of a polynomial Journal of Research of the National Bureau of Standards - B. Mathematics and Mathematical Physics 70B 1966 79 81
35. J.M. Carnicer, and J.M. Peña Shape preserving representations and optimality of the Bernstein basis Advances in Computational Mathematics 1 1993 173 196
36. G. Chang Bernstein polynomials via the shifting operator American Mathematical Monthly 91 1984 634 638
37. G. Chang, and J. Wu Mathematical foundations of Bézier's technique Computer Aided Design 13 1981 133 136
38. P. Charrot, and J.A. Gregory A pentagonal surface patch for computer aided geometric design Computer Aided Geometric Design 1 1984 87 94 (Pubitemid 16494160)
39. E. Cohen, and L.L. Schumaker Rates of convergence of control polygons Computer Aided Geometric Design 2 1985 229 235
40. L. Coluccio, A. Eisinberg, and G. Fedele Gauss-Lobatto to Bernstein polynomials transformation Journal of Computational and Applied Mathematics 222 2008 690 700
41. M.J. Crowe A History of Vector Analysis 1967 Dover Publications New York (reprint)
42. E.W. Cheney Introduction to Approximation Theory 1966 McGraw-Hill New York
43. W. Dahmen Subdivision algorithms converge quadratically Journal of Computational and Applied Mathematics 16 1986 145 158
44. M. Daniel, and J.C. Daubisse The numerical problem of using Bézier curves and surfaces in the power basis Computer Aided Geometric Design 6 1989 121 128
45. G. Dasgupta Interpolants within convex polygons: Wachspress shape functions Journal of Aerospace Engineering 16 2003 1 8 (Pubitemid 40265231)
46. P.J. Davis Interpolation and Approximation 1975 Dover Publications New York (reprint)
47. C. de Boor Cutting corners always works Computer Aided Geometric Design 4 1987 125 131
48. C. de Boor B-form basics G.E. Farin, Geometric Modeling: Algorithms and New Trends 1987 SIAM Philadelphia 131 148
49. C. de Boor A Practical Guide to Splines revised edition 2001 Springer New York
50. C. de Boor, and K. Höllig B-splines without divided differences G.E. Farin, Geometric Modeling: Algorithms and New Trends 1987 SIAM Philadelphia 21 27
51. de Casteljau, P.; 1963. Courbes et Surfaces à Pôles. Société Anonyme André Citroën, Internal Report.
52. P. de Casteljau Formes à Pôles 1985 Hermès Paris
53. P. de Casteljau Shape Mathematics and CAD 1986 Kogan-Page London
54. P. de Casteljau Les Quaternions 1987 Hermès Paris
55. P. de Casteljau POLynomials, POLar forms, and interPOLation T. Lyche, L.L. Schumaker, Mathematical Methods in Computer Aided Geometric Design II 1991 Academic Press Boston 57 68
56. P. de Casteljau Polar forms for curve and surface modelling as used at Citroën L. Piegl, Fundamental Developments of Computer-Aided Geometric Modeling 1993 Academic Press London 1 11
57. P. de Faget de Casteljau De Casteljau's autobiography: My time at Citroën Computer Aided Geometric Design 16 1999 583 586
58. J. Delgado, and J.M. Peña Optimal conditioning of Bernstein collocation matrices SIAM Journal on Matrix Analysis and Applications 31 2009 990 996
59. T.D. DeRose Composing Bézier simplexes ACM Transactions on Graphics 7 1988 198 221
60. R.C. Dorf, and R.H. Bishop Modern Control Systems 10th edition 2005 Pearson Prentice Hall Upper Saddle River, NJ
61. M.G. Duffy Quadrature over a pyramid or cube of integrands with a singularity at a vertex SIAM Journal on Numerical Analysis 19 1982 1260 1262
62. C. Dyken, and M.S. Floater Transfinite mean value interpolation Computer Aided Geometric Design 26 2009 117 134
63. V. Dzhafarov, T. Büyükköroǧlu, and O. Esen On different types of stability of linear polytopic systems Proceedings of the Steklov Institute of Mathematics 269 2010 66 74
64. M. Eck Degree reduction of Bézier curves Computer Aided Geometric Design 10 1993 237 251
65. M. Eck Least squares degree reduction of Bézier curves Computer Aided Design 27 1995 845 851
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.
67. J.F. Epperson On the Runge example American Mathematical Monthly 94 1987 329 341
68. C.A. Ernesto, and R.T. Farouki High-speed cornering by CNC machines under prescribed bounds on axis accelerations and toolpath contour error International Journal of Advanced Manufacturing Technology 58 2012 327 338
69. G.E. Farin Algorithms for rational Bézier curves Computer Aided Design 15 1983 73 77
70. G.E. Farin Triangular Bernstein-Bézier patches Computer Aided Geometric Design 3 1986 83 127
71. G. Farin Curvature continuity and offsets for piecewise conics ACM Transactions on Graphics 8 1989 89 99
72. G.E. Farin Surfaces over Dirichlet tessellations Computer Aided Geometric Design 7 1990 281 292
73. G.E. Farin Curves and Surfaces for CAGD: A Practical Guide 5th edition 2002 Morgan Kaufmann San Francisco
74. G. Farin, B. Piper, and A. Worsey The octant of a sphere as a non-degenerate triangular Bézier patch Computer Aided Geometric Design 4 1987 329 332 (Pubitemid 18595146)
75. R.T. Farouki On the stability of transformations between power and Bernstein polynomial forms Computer Aided Geometric Design 8 1991 29 36
76. R.T. Farouki Computing with barycentric polynomials The Mathematical Intelligencer 13 1991 61 69
77. R.T. Farouki The conformal map z ↑ z 2 of the hodograph plane Computer Aided Geometric Design 11 1994 363 390
78. R.T. Farouki Legendre-Bernstein basis transformations Journal of Computational and Applied Mathematics 119 2000 145 160
79. R.T. Farouki Pythagorean-Hodograph Curves: Algebra and Geometry Inseparable 2008 Springer Berlin
80. R.T. Farouki, and J.-C.A. Chastang Curves and surfaces in geometrical optics T. Lyche, L.L. Schumaker, Mathematical Methods in Computer Aided Geometric Design II 1991 Academic Press Boston 239 260
81. R.T. Farouki, and T.N.T. Goodman On the optimal stability of the Bernstein basis Mathematics of Computation 65 1996 1553 1566
82. R.T. Farouki, and C.A. Neff On the numerical condition of Bernstein-Bézier subdivision processes Mathematics of Computation 55 1990 637 647
83. R.T. Farouki, and V.T. Rajan On the numerical condition of polynomials in Bernstein form Computer Aided Geometric Design 4 1987 191 216 (Pubitemid 18549600)
84. R.T. Farouki, and V.T. Rajan Algorithms for polynomials in Bernstein form Computer Aided Geometric Design 5 1988 1 26
85. R.T. Farouki, Y.-F. Tsai, and C.S. Wilson Physical constraints on feedrates and feed accelerations along curved tool paths Computer Aided Geometric Design 17 2000 337 359
86. W. Feller An Introduction to Probability Theory and its Applications, vol. 1 1950 Wiley New York
87. M.S. Floater Mean value coordinates Computer Aided Geometric Design 20 2003 19 27
88. M.S. Floater On the convergence of derivatives of Bernstein approximation Journal of Approximation Theory 134 2005 130 135 (Pubitemid 40595452)
89. M.S. Floater, K. Hormann, and G. Kós A general construction of barycentric coordinates over convex polygons Advances in Computational Mathematics 24 2006 311 331 (Pubitemid 43563925)
90. A.R. Forrest Interactive interpolation and approximation by Bézier polynomials The Computer Journal 15 1972 71 79
91. C. Fünfzig, D. Michelucci, and S. Foufou Polytope-based computation of polynomial ranges Computer Aided Geometric Design 29 2012 18 29
92. J. Garloff Application of Bernstein expansion to the solution of control problems Reliable Computing 6 2000 303 320
93. J. Garloff, and B. Graf Robust Schur stability of polynomials with polynomial parameter dependency Multidimensional Systems and Signal Processing 10 1999 189 199
94. J. Garloff, C. Jansson, and A.P. Smith Lower bound functions for polynomials Journal of Computational and Applied Mathematics 157 2003 207 225 (Pubitemid 36941711)
95. J. Garloff, and A.P. Smith Investigation of a subdivision based algorithm for solving systems of polynomial equations Nonlinear Analysis 47 2001 167 178 (Pubitemid 32707159)
96. W. Gautschi On the condition of algebraic equations Numerische Mathematik 21 1973 405 424
97. W. Gautschi Questions of numerical condition related to polynomials G.H. Golub, Studies in Numerical Analysis MAA Studies in Mathematics vol. 24 1984 140 177
98. P. Goetgheluck Computing binomial coefficients American Mathematical Monthly 94 1987 360 365
99. P. Goetgheluck On prime divisors of binomial coefficients Mathematics of Computation 51 1988 325 329
100. R.N. Goldman Markov chains and computer-aided geometric design: Part I - problems and constraints ACM Transactions on Graphics 3 1984 204 222
101. R.N. Goldman Markov chains and computer-aided geometric design: Part II - examples and subdivision matrices ACM Transactions on Graphics 4 1985 12 40
102. R.N. Goldman Polya's urn model and computer aided geometric design SIAM Journal on Algebraic and Discrete Methods 6 1985 1 28
103. R. Goldman Pyramid Algorithms: A Dynamic Programming Approach to Curves and Surfaces for Geometric Modeling 2003 Morgan Kaufmann San Francisco
104. R.N. Goldman, T.W. Sederberg, and D.C. Anderson Vector elimination: A technique for the implicitization, inversion, and intersection of planar parametric rational polynomial curves Computer Aided Geometric Design 1 1984 327 356
105. T.N.T. Goodman Shape preserving representations T. Lyche, L.L. Schumaker, Mathematical Methods in Computer Aided Geometric Design 1989 Academic Press Boston 333 351
106. W.J. Gordon, and R.F. Riesenfeld Bernstein-Bézier methods for the computer-aided design of free-form curves and surfaces Journal of the Association for Computing Machinery 21 1974 293 310
107. J.A. Gregory N-sided surface patches J.A. Gregory, The Mathematics of Surfaces 1986 Clarendon Press Oxford 217 232
108. P. Henrici Elements of Numerical Analysis 1964 Wiley New York
109. T. Hermann On the stability of polynomial transformations between Taylor, Bézier, and Hermite forms Numerical Algorithms 13 1996 307 320
110. T.-S. Ho, and H. Rabitz Proper construction of ab initio global potential surfaces with accurate long-range interactions Journal of Chemical Physics 113 2000 3960 3968
111. X. Hong, and C.J. Harris Generalized neurofuzzy network modeling algorithms using Bézier-Bernstein polynomial functions and additive decomposition IEEE Transactions on Neural Networks 11 2000 889 902
112. K. Hormann, and M.S. Floater Mean value coordinates for arbitrary planar polygons ACM Transactions on Graphics 25 2006 1424 1441 (Pubitemid 44917211)
113. K. Hormann, and N. Sukumar Maximum entropy coordinates for arbitrary polytopes Computer Graphics Forum 27 2008 1513 1520
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.
115. M. Hosaka, and F. Kimura Non-four-sided patch expressions with control points Computer Aided Geometric Design 1 1984 75 86 (Pubitemid 16494159)
116. J. Hoschek, and D. Lasser Fundamentals of Computer-Aided Geometric Design 1993 AK Peters Translated from German by L.L. Schumaker
117. T.J.R. Hughes, J.A. Cottrell, and Y. Bazilevs Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement Computer Methods in Applied Mechanics and Engineering 194 2005 4135 4195 (Pubitemid 40875970)
118. E. Isaacson, and H.B. Keller Analysis of Numerical Methods 1994 Dover New York
119. B. Jüttler The dual basis functions for the Bernstein polynomials Advances in Computational Mathematics 8 1998 345 352
120. P. Kiciak, and A. Zidna Recursive de Casteljau bisection and rounding errors Computer Aided Geometric Design 21 2004 683 695
121. R.C. Kirby Fast simplicial finite element algorithms using Bernstein polynomials Numerische Mathematik 117 2011 631 652
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.
123. G.K. Knopf, and J. Kofman Free-form surface reconstruction using Bernstein basis function networks Intelligent Engineering Systems through Artificial Neural Networks vol. 9 1999 ASME 797 802 (Pubitemid 30523782)
124. G.K. Knopf, and J. Kofman Surface reconstruction using neural network mapping of range-sensor images to object space Journal of Electronic Imaging 11 2002 187 194 (Pubitemid 34536984)
125. P.P. Korovkin Linear Operators and Approximation Theory 1960 Hindustan Publishing Corporation Delhi (translated from Russian)
126. R. Krasauskas Toric surface patches Advances in Computational Mathematics 17 2002 89 113 (Pubitemid 37130917)
127. J. Krautter, and S. Parizot 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 1971 581 586
128. M.A. Lachance Chebyshev economization for parametric surfaces Computer Aided Geometric Design 5 1988 195 208
129. M.J. Lai, and L.L. Schumaker Spline Functions on Triangulations 2007 Cambridge University Press Cambridge
130. J.M. Lane, and R.F. Riesenfeld A theoretical development for the computer generation and display of piecewise polynomial surfaces IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-2 1980 35 46
131. J.M. Lane, and R.F. Riesenfeld Bounds on a polynomial BIT 21 1981 112 117
132. P.-J. Laurent, and P. Sablonnière Pierre Bézier: An engineer and a mathematician Computer Aided Geometric Design 18 2001 609 617
133. Y.-M. Li, and X.-Y. Zhang Basis conversion among Bézier, Tchebyshev, and Legendre Computer Aided Geometric Design 15 1998 637 642 (Pubitemid 128378631)
134. C.T. Loop, and T.D. DeRose A multi-sided generalization of Bézier surfaces ACM Transactions on Graphics 8 1989 204 234
135. G.G. Lorentz Bernstein Polynomials 1953 University of Toronto Press
136. D. Lutterkort, J. Peters, and U. Reif Polynomial degree reduction in the L 2 -norm equals best Euclidean approximation of Bézier coefficients Computer Aided Geometric Design 16 1999 607 612 (Pubitemid 30500635)
137. S. Malan, M. Milanese, and M. Taragna Robust analysis and design of control systems using interval arithmetic Automatica 33 1997 1363 1372 (Pubitemid 127433518)
138. E.A. Malsch, and G. Dasgupta Shape functions for polygonal domains with interior nodes International Journal for Numerical Methods in Engineering 61 2004 1153 1172 (Pubitemid 39428572)
139. E.A. Malsch, J.J. Lin, and G. Dasgupta Smooth two dimensional interpolants: A recipe for all polygons Journal of Graphics Tools 10 2005 27 39
140. A. Marco, and J.-J. Martínez A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems Linear Algebra and its Applications 422 2007 616 628 (Pubitemid 46329687)
141. A. Marco, and J.-J. Martínez Polynomial least squares fitting in the Bernstein basis Linear Algebra and its Applications 433 2010 1254 1264
142. M.-L. Mazure Blossoms and optimal bases Advances in Computational Mathematics 20 2004 177 203 (Pubitemid 38103623)
143. M. Meyer, H. Lee, A. Barr, and M. Desbrun Generalized barycentric coordinates on irregular polygons Journal of Graphics Tools 7 2002 13 22
144. C.A. Micchelli, and H. Prautzsch Uniform refinement of curves Linear Algebra and its Applications 114 1989 841 870
145. H. Minc Nonnegative Matrices 1988 Wiley New York
146. M. Minimair Basis-independent polynomial division algorithm applied to division in Lagrange and Bernstein basis D. Kapur, Computer Mathematics Lectures Notes in Artificial Intelligence vol. 5081 2008 Springer Berlin 72 86
147. B. Mourrain, and J.P. Pavone Subdivision methods for solving polynomial equations Journal of Symbolic Computation 44 2009 292 306
148. H. Müller, and M. Otte Solving algebraic systems in Bernstein-Bézier representation Lecture Notes in Computer Science vol. 553 1991 Springer New York 161 169
149. D. Nairn, J. Peters, and D. Lutterkort Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon Computer Aided Geometric Design 16 1999 613 631 (Pubitemid 30500636)
150. P.S.V. Nataraj, and M. Arounassalame Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm Journal of Global Optimization 49 2011 185 212
151. J.M. Peña B-splines and optimal stability Mathematics of Computation 66 1997 1555 1560 (Pubitemid 127374349)
152. J.M. Peña On the optimal stability of bases of univariate functions Numerische Mathematik 91 2002 305 318 (Pubitemid 36161542)
153. G.M. Phillips A survey of results on the q-Bernstein polynomials IMA Journal of Numerical Analysis 30 2010 277 288
154. U. Pinkall, and K. Polthier Computing discrete minimal surfaces and their conjugates Experimental Mathematics 2 1993 15 36
155. A. Pinkus Weierstrass and approximation theory Journal of Approximation Theory 107 2000 1 66
156. M.J.D. Powell Approximation Theory and Methods 1981 Cambridge University Press Cambridge
157. H. Prautzsch, W. Boehm, and M. Paluszny Bézier and B-spline Techniques 2002 Springer Berlin
158. H. Prautzsch, and L. Kobbelt Convergence of subdivision and degree elevation Advances in Computational Mathematics 2 1994 143 154
159. F.P. Preparata, and M.I. Shamos Computational Geometry: An Introduction 1985 Springer New York
160. A. Rababah Transformation of Chebyshev-Bernstein polynomial basis Computational Methods in Applied Mathematics 3 2003 608 622
161. A. Rababah Jacobi-Bernstein basis transformations Computational Methods in Applied Mathematics 4 2004 206 214
162. A. Rababah, and M. al-Natour The weighted dual functionals for the univariate Bernstein basis Applied Mathematics and Computation 186 2007 1581 1590 (Pubitemid 46497365)
163. C. Rabut On Pierre Bézier's life and motivations Computer Aided Design 34 2002 493 510
164. Ramshaw, L.; 1987. Blossoming: A connect-the-dots approach to splines. Digital Equipment Corporation, SRC Report No. 19.
165. L. Ramshaw Blossoms are polar forms Computer Aided Geometric Design 6 1989 323 358 (Pubitemid 20635182)
166. S. Ray, and P.S.V. Nataraj An efficient algorithm for range computation of polynomials using the Bernstein form Journal of Global Optimization 45 2009 403 426
167. J.R. Rice A theory of condition SIAM Journal on Numerical Analysis 3 1966 287 310
168. T.J. Rivlin Bounds on a polynomial Journal of Research of the National Bureau of Standards - B. Mathematical Sciences 74B 1970 47 54
169. T.J. Rivlin An Introduction to the Approximation of Functions 1981 Dover Publications New York (reprint)
170. S. Samadi Explicit formula for improved filter sharpening polynomial IEEE Transactions on Signal Processing 9 2000 2957 2959
171. J. Sánchez-Reyes Complex rational Bézier curves Computer Aided Geometric Design 26 2009 865 876
172. S. Schaefer, T. Ju, and J. Warren A unified, integral construction for coordinates over closed curves Computer Aided Geometric Design 24 2007 481 493 (Pubitemid 47562132)
173. L.L. Schumaker Spline Functions: Basic Theory 1981 Wiley New York
174. L.L. Schumaker Computing bivariate splines in scattered data fitting and the finite-element method Numerical Algorithms 48 2008 237 260
175. A.J. Schwartz Subdividing Bézier curves and surfaces G. Farin, Geometric Modeling: Algorithms and New Trends 1987 SIAM Philadelphia 55 66
176. M.A. Scott, M.J. Borden, C.V. Verhoosel, T.W. Sederberg, and T.J.R. Hughes Isogeometric finite element data structures based on Bézier extraction of T-splines International Journal for Numerical Methods in Engineering 88 2011 126 156
177. T.W. Sederberg Planar piecewise algebraic curves Computer Aided Geometric Design 1 1984 241 255
178. T.W. Sederberg Piecewise algebraic surface patches Computer Aided Geometric Design 2 1985 53 59
179. T.W. Sederberg, and S.R. Parry Free-form deformation of solid geometric models ACM SIGGRAPH Computer Graphics 20 4 1986 151 160
180. H.-P. Seidel A new multiaffine approach to B-splines Computer Aided Geometric Design 6 1989 23 32
181. E.C. Sherbrooke, and N.M. Patrikalakis Computation of the solutions of nonlinear polynomial systems Computer Aided Geometric Design 10 1993 379 405
182. R. Sibson A vector identity for the Dirichlet tessellation Mathematical Proceedings of the Cambridge Philosophical Society 87 1980 151 155
183. R. Sibson A brief description of the natural neighbor interpolant V. Barnett, Interpolating Multivariate Data 1981 Wiley Chichester 21 36
184. D.D. Šiljak, and D.M. Stipanović Robust D-stability via positivity Automatica 35 1999 1477 1484
185. P. Simeonov, V. Zafiris, and R. Goldman h-Blossoming: A new approach to algorithms and identities for h-Bernstein bases and h-Bézier curves Computer Aided Geometric Design 28 2011 549 565
186. P. Simeonov, V. Zafiris, and R. Goldman q-Blossoming: A new approach to algorithms and identities for q-Bernstein bases and q-Bézier curves Journal of Approximation Theory 164 2012 77 104
187. Y. Simsek Construction a new generating function of Bernstein type polynomials Applied Mathematics and Computation 218 2011 1072 1076
188. Simsek, Y.; 2011b. Functional equations from generating functions: A novel approach to deriving identities for the Bernstein basis functions, preprint.
189. Simsek, Y.; 2011c. Generating functions for the Bernstein polynomials: A unified approach to deriving identities for the Bernstein basis functions, preprint.
190. A.P. Smith Fast construction of constant bound functions for sparse polynomials Journal of Global Optimization 43 2009 445 458
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.
192. D.D. Stancu Approximation of functions by a new class of linear polynomial operators Revue Roumaine de Mathématique Pures et Appliquées 13 1968 1173 1194
193. D.D. Stancu Approximation of functions by means of a new generalized Bernstein operator Calcolo 20 1983 211 229
194. E.L. Stark Bernstein-Polynome, 1912-1955 P.L. Butzer, B. Sz.-Nagy, E. Görlich, Functional Analysis and Approximation 1981 Birkhäuser Basel 443 461
195. K.-G. Steffens The History of Approximation Theory: From Euler to Bernstein 2006 Birkhäuser Boston
196. G.W. Stewart Introduction to Matrix Computations 1973 Academic Press New York
197. N. Sukumar Construction of polygonal interpolants: A maximum entropy approach International Journal for Numerical Methods in Engineering 61 2004 2159 2181 (Pubitemid 39622525)
198. N. Sukumar, and E.A. Malsch Recent advances in the construction of polygonal finite element interpolants Archives of Computational Methods in Engineering 13 2006 129 163 (Pubitemid 43864188)
199. N. Sukumar, and B. Moran C 1 natural neighbor interpolant for partial differential equations Numerical Methods for Partial Differential Equations 15 1999 417 447 (Pubitemid 129531505)
200. N. Sukumar, B. Moran, and T. Belytschko The natural element method in solid mechanics International Journal for Numerical Methods in Engineering 43 1998 839 887
201. N. Sukumar, and A. Tabarraei Conforming polygonal finite elements International Journal for Numerical Methods in Engineering 61 2004 2045 2066 (Pubitemid 39622521)
202. B. Szafnicki A unified approach for degree reduction of polynomials in the Bernstein basis. Part I: Real polynomials Journal of Computational and Applied Mathematics 142 2002 287 312 (Pubitemid 34696434)
203. G.P. Tolstov Fourier Series 1976 Dover Publications New York (reprint, translated from Russian by R.A. Silverman)
204. Y.-F. Tsai, and R.T. Farouki Algorithm 812: BPOLY: An object-oriented library of numerical algorithms for polynomials in Bernstein form ACM Transactions on Mathematical Software 27 2001 267 296 (Pubitemid 33602328)
205. J.V. Uspensky Theory of Equations 1948 McGraw-Hill New York
206. E. Voronowskaja Détermination de la forme asymptotique d'approximation des fonctions par les polynômes de M. Bernstein Doklady Akademii Nauk SSSR 1932 1932 79 85
207. E.L. Wachspress A Rational Finite Element Basis 1975 Academic Press New York
208. E.L. Wachspress Barycentric coordinates for polytopes Computers and Mathematics with Applications 61 2011 3319 3321
209. J. Warren Creating multisided rational Bézier surfaces using base points ACM Transactions on Graphics 11 1992 127 139 (Pubitemid 23599628)
210. J. Warren Barycentric coordinates for convex polytopes Advances in Computational Mathematics 6 1996 97 108
211. J. Warren, S. Schaefer, A.N. Hirani, and M. Desbrun Barycentric coordinates for convex sets Advances in Computational Mathematics 27 2007 319 338
212. M.A. Watkins, and A.J. Worsey Degree reduction of Bézier curves Computer Aided Design 20 1988 398 405
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.
214. H.S. Wilf Generatingfunctionology 1990 Academic Press Boston
215. J.H. Wilkinson The evaluation of the zeros of ill-conditioned polynomials, Parts I & II Numerische Mathematik 1 1959 150 166 167-180
216. J.H. Wilkinson Rounding Errors in Algebraic Processes 1963 Prentice-Hall Englewood Cliffs, NJ
217. J.H. Wilkinson The perfidious polynomial G.H. Golub, Studies in Numerical Analysis MAA Studies in Mathematics vol. 24 1984 1 28
218. J.R. Winkler A resultant matrix for scaled Bernstein polynomials Linear Algebra and its Applications 319 2000 179 191
219. J.R. Winkler A companion matrix resultant for Bernstein polynomials Linear Algebra and its Applications 362 2003 153 175
220. J.R. Winkler The transformation of the companion matrix resultant between the power and Bernstein polynomial bases Applied Numerical Mathematics 48 2004 113 126
221. J.R. Winkler A unified approach to resultant matrices for Bernstein basis polynomials Computer Aided Geometric Design 25 2008 529 541
222. A.P. Youschkevitch Sergey Natanovich Bernstein C.C. Gillespie, Dictionary of Scientific Biography Supplement I vol. XV 1980 Charles Scribner's Sons New York 22 24
223. M. Zettler, and J. Garloff Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion IEEE Transactions on Automatic Control 43 1998 425 431 (Pubitemid 128737364)
224. A. Zidna, and D. Michel A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis Mathematics and Computers in Simulation 77 2008 313 323 (Pubitemid 351273911)