Evaluation and Approximate Evaluation of the Multivariate Bernstein-Bézier form on a Regularly Partitioned Simplex

22Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Polynomials of the total degree d in m variables have a geometrically intuitive representation in the Bernstein-Be´zier form defined over an m-dimensional simplex. The two algorithms given in this article evaluate the Bernstein-Be´zier form on a large number of points corresponding to a regular partition of the simplicial domain. The first algorithm is an adaptation of isoparametric evaluation. The second is a subdivision algorithm. In contrast to de Casteljau's algorithm, both algorithms have a cost of evaluation per point that is linear in the degree regardless of the number of variables. To demonstrate practicality, implementations of both algorithms on a triangular domain are compared with generic implementations of six algorithms in the literature. © 1994, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Peters, J. (1994). Evaluation and Approximate Evaluation of the Multivariate Bernstein-Bézier form on a Regularly Partitioned Simplex. ACM Transactions on Mathematical Software (TOMS), 20(4), 460–480. https://doi.org/10.1145/198429.198434

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free