full
search.png

Search

close.png

Cancel

arrow
Volume 14, Issue 3
On Computing Zeros of a Bivariate Bernstein Polynomial

F. L. Chen & J. Kozak

J. Comp. Math., 14 (1996), pp. 237-248.

Published online: 1996-06

Preview Full PDF 2450 24667

Cited by

google scholar semantic scholar
Export citation
  • Abstract

In this paper, the problem of computing zeros of a general degree bivariate Bernstein polynomial is considered. An efficient and robust algorithm is presented that takes into full account particular properties of the function considered. The algorithm works for rectangular as well as triangular domains. The outlined procedure can also be applied for the computation of the intersection of a Bézier patch and a plane as well as in the determination of an algebraic curve restricted to a compact domain. In particular, singular points of the algebraic curve are reliably detected.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-14-237, author = {F. L. Chen and J. Kozak}, title = {On Computing Zeros of a Bivariate Bernstein Polynomial}, journal = {Journal of Computational Mathematics}, year = {1996}, volume = {14}, number = {3}, pages = {237--248}, abstract = {

In this paper, the problem of computing zeros of a general degree bivariate Bernstein polynomial is considered. An efficient and robust algorithm is presented that takes into full account particular properties of the function considered. The algorithm works for rectangular as well as triangular domains. The outlined procedure can also be applied for the computation of the intersection of a Bézier patch and a plane as well as in the determination of an algebraic curve restricted to a compact domain. In particular, singular points of the algebraic curve are reliably detected.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9234.html} }
TY - JOUR T1 - On Computing Zeros of a Bivariate Bernstein Polynomial AU - F. L. Chen & J. Kozak JO - Journal of Computational Mathematics VL - 3 SP - 237 EP - 248 PY - 1996 DA - 1996/06 SN - 14 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/9234.html KW - AB -

In this paper, the problem of computing zeros of a general degree bivariate Bernstein polynomial is considered. An efficient and robust algorithm is presented that takes into full account particular properties of the function considered. The algorithm works for rectangular as well as triangular domains. The outlined procedure can also be applied for the computation of the intersection of a Bézier patch and a plane as well as in the determination of an algebraic curve restricted to a compact domain. In particular, singular points of the algebraic curve are reliably detected.

F. L. Chen and J. Kozak. (1996). On Computing Zeros of a Bivariate Bernstein Polynomial. Journal of Computational Mathematics. 14 (3). 237-248. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard