Year: 1996
Journal of Computational Mathematics, Vol. 14 (1996), Iss. 3 : pp. 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.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1996-JCM-9234
Journal of Computational Mathematics, Vol. 14 (1996), Iss. 3 : pp. 237–248
Published online: 1996-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 12