The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
The Bernstein polynomial basis: A centennial retrospective
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
de Boor, C. (1978) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-6333-3 · Cited by 11,944
Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement
Hughes, T. J. R., Cottrell, J. A., & Bazilevs, Y. (2005) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2004.10.008 · Cited by 6,335
Computational Geometry--An Introduction.
Atallah, M. J., Preparata, F. P., & Shamos, M. I. (1986) · Mathematics of Computation · doi:10.2307/2008200 · Cited by 4,238
Free-form deformation of solid geometric models
Sederberg, T. W., & Parry, S. R. (1986) · ACM SIGGRAPH Computer Graphics · doi:10.1145/15886.15903 · Cited by 2,577
Dorf, R. C., & Sinha, N. K. (1981) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1981.4308749 · Cited by 2,482
Spline Functions: Basic Theory.
Smith, P. W., & Schumaker, L. (1982) · Mathematics of Computation · doi:10.2307/2007301 · Cited by 2,463
Dictionary of Scientific Biography
Miller, S. T. (1981) · Reference Services Review · doi:10.1108/eb048704 · Cited by 2,405
Introduction to matrix computations
Stewart, G. W. (1973) · International Linear Collider · Cited by 2,381
Isaacson, E., Keller, H. B., & Weiss, G. H. (1967) · Physics Today · doi:10.1063/1.3034415 · Cited by 2,262
Introduction to Approximation Theory
Rivlin, T., & Cheney, E. W. (1969) · Mathematics of Computation · doi:10.2307/2004443 · Cited by 2,035
Interpolation and Approximation
(2003) · A Numerical Library in Java for Scientists and Engineers · doi:10.1201/9780203507643.ch7 · Cited by 1,608
Curves and surfaces for CAGD : a practical guide
Farin, G. E. (2001) · Cited by 1,454
An Introduction to Probability Theory and Its Applications, Vol. 1
Feller, W. (1968) · Cited by 1,446
Rounding errors in algebraic processes
(1964) · Journal of the Franklin Institute · doi:10.1016/0016-0032(64)90390-4 · Cited by 1,315
Computing Discrete Minimal Surfaces and Their Conjugates
Pinkall, U., & Polthier, K. (1993) · Experimental Mathematics · doi:10.1080/10586458.1993.10504266 · Cited by 1,249
Multiresolution analysis of arbitrary meshes
Eck, M., DeRose, T., Duchamp, T., Hoppe, H., Lounsbery, M., & Stuetzle, W. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218440 · Cited by 1,205
Floater, M. S. (2003) · Computer Aided Geometric Design · doi:10.1016/s0167-8396(03)00002-5 · Cited by 1,079
Approximation Theory and Methods.
Wahlbin, L. B., & Powell, M. J. D. (1982) · Mathematics of Computation · doi:10.2307/2007351 · Cited by 805
An Introduction to the Approximation of Functions
Jerome, J. (1970) · Technometrics · doi:10.1080/00401706.1970.10488686 · Cited by 738
Uspensky, J. V. (1958) · CERN Document Server (European Organization for Nuclear Research) · Cited by 702
Elements of Numerical Analysis
Hamming, R. W., & Henrici, P. (1965) · Mathematics of Computation · doi:10.2307/2003710 · Cited by 659
The natural element method in solid mechanics
Sukumar, N., Moran, B., & Belytschko, T. (1998) · International Journal for Numerical Methods in Engineering · doi:10.1002/(sici)1097-0207(19981115)43:5 · Cited by 657
Robust Control: Systems With Uncertain Physical Parameters
Ackermann, J. E., Bartlett, A., Kaesbauer, D., et al. (1993) · Medical Entomology and Zoology · Cited by 626
An Introduction to Probability
(2008) · Probably Not · doi:10.1002/9780470282052.ch1 · Cited by 585
Conforming polygonal finite elements
Sukumar, N., & Tabarraei, A. (2004) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.1141 · Cited by 477
Computer Aided Geometric Design
(1974) · Elsevier eBooks · doi:10.1016/c2013-0-10333-9 · Cited by 446
An Introduction to Probability Theory and Its Applications; Vol. 1
Krickeberg, K., & Feller, W. (1969) · Revue de l Institut International de Statistique / Review of the International Statistical Institute · doi:10.2307/1402100 · Cited by 393
(1990) · Elsevier eBooks · doi:10.1016/c2013-0-11714-x · Cited by 374
Pythagorean-Hodograph Curves: Algebra and Geometry Inseparable
Farouki, R. T. (2008) · Geometry and computing · doi:10.1007/978-3-540-73398-0 · Cited by 367
Self-citationMandyam N, A. (2021) · Mapana Journal of Sciences · doi:10.12723/mjs.56.5 · Cited by 357
Recent advances in the construction of polygonal finite element interpolants
Sukumar, N., & Malsch, E. A. (2006) · Archives of Computational Methods in Engineering · doi:10.1007/bf02905933 · Cited by 293
Construction of polygonal interpolants: a maximum entropy approach
Sukumar, N. (2004) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.1193 · Cited by 274
Crowe, M. G., & Williamson, R. E. (1969) · American Journal of Physics · doi:10.1119/1.1975883 · Cited by 191
Epperson, J. F. (1987) · The American Mathematical Monthly · doi:10.1080/00029890.1987.12000642 · Cited by 180
Maximum Entropy Coordinates for Arbitrary Polytopes
Hormann, K., & Sukumar, N. (2008) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2008.01292.x · Cited by 134
A fast and accurate algorithm for solving Bernstein–Vandermonde linear systems
Marco, A., & Martínez, J. (2007) · Linear Algebra and its Applications · doi:10.1016/j.laa.2006.11.020 · Cited by 100
Interpolation and Approximation
Trangenstein, J. A. (2017) · Texts in computational science and engineering · doi:10.1007/978-3-319-69110-7_1 · Cited by 92
Krasauskas, R. (2002) · Advances in Computational Mathematics · doi:10.1023/a:1015289823859 · Cited by 90
Degree reduction of Bézier curves
Watkins, M. A., & Worsey, A. J. (1988) · Computer-Aided Design · doi:10.1016/0010-4485(88)90216-3 · Cited by 83
Fast simplicial finite element algorithms using Bernstein polynomials
Kirby, R. C. (2010) · Numerische Mathematik · doi:10.1007/s00211-010-0327-2 · Cited by 50
Polynomial least squares fitting in the Bernstein basis
Marco, A., & Martínez, J. (2010) · Linear Algebra and its Applications · doi:10.1016/j.laa.2010.06.031 · Cited by 47
Bini, D. A., & Gemignani, L. (2004) · Theoretical Computer Science · doi:10.1016/j.tcs.2004.01.016 · Cited by 43
An efficient algorithm for range computation of polynomials using the Bernstein form
Ray, S., & Nataraj, P. S. V. (2008) · Journal of Global Optimization · doi:10.1007/s10898-008-9382-y · Cited by 31
A companion matrix resultant for Bernstein polynomials
Winkler, J. R. (2003) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(02)00486-x · Cited by 27
The numerical problem of using Be´zier curves and surfaces in the power basis
Daniel, M., & Daubisse, J. C. (1989) · Computer Aided Geometric Design · doi:10.1016/0167-8396(89)90015-0 · Cited by 25
Lin, Z., Chen, H., Shum, H., et al. (2005) · Journal of Graphics Tools · doi:10.1080/2151237x.2005.10129191 · Cited by 6
On different types of stability of linear polytopic systems
Dzhafarov, V., Büyükköroğlu, T., & Esen, Ö. (2010) · Proceedings of the Steklov Institute of Mathematics · doi:10.1134/s0081543810070060 · Cited by 5
Cited by
An Overview of Backdoor Attacks Against Deep Neural Networks and Possible Defences
Guo, W., Tondi, B., & Barni, M. (2022) · IEEE Open Journal of Signal Processing · doi:10.1109/ojsp.2022.3190213 · Cited by 91
Metadata
- Authors
- Farouki, R. T.
- Venue
- Computer Aided Geometric Design
- Publisher
- Elsevier BV
- Published
- 2012-08
- Volume
- 29
- Issue
- 6
- Pages
- 379-419
- ISSN
- 0167-8396 (ISSN-L)
- OpenAlex
- W2073330885
- Cited by
- 506
- References
- 48
- FWCI
- 24.46
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.