Name
Abstract | ||
|---|---|---|
Polynomial functions F of degree m have a form in the Bernstein basis defined over l-dimensional simplex W. The Bernstein coefficients exhibit a number of special properties. The function F can be optimised by the smallest and largest Bernstein coefficients (enclosure bounds) over W. By a proper choice of barycentric subdivision steps of W, we prove the inclusion property of Bernstein enclosure bounds. To this end, we provide an algorithm that computes the Bernstein coefficients over subsimplices. These coefficients are collected in an l-dimensional array in the field of computer-aided geometric design. Such a construct is typically classified as a patch. We show that the Bernstein coefficients of F over the faces of a simplex coincide with the coefficients contained in the patch. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1142/S0219649220400018 | JOURNAL OF INFORMATION & KNOWLEDGE MANAGEMENT |
Keywords | DocType | Volume |
Bernstein expansion, simplex, computing of range values, inclusion of bounds, face values | Journal | 19 |
Issue | ISSN | Citations |
1 | 0219-6492 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tareq Hamadneh | 1 | 0 | 0.34 |
| Hassan Al-Zoubi | 2 | 3 | 1.07 |
| Saleh Ali Alomari | 3 | 1 | 0.71 |