An explicit formula as well as a geometric algorithm are given for converting a rectangular subpatch of a triangular Bézier surface into a tensor product Bézier representation. Based on de Casteljau recursions and convex combinations of combinatorial constants, both formula and algorithm are numeric
Minimal quasi-Bézier surface
✍ Scribed by Hao, Yong-Xia; Wang, Ren-Hong; Li, Chong-Jun
- Book ID
- 119191502
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 243 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0307-904X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The Plateau-Bézier problem consists in finding the Bézier surface with minimal area from among all Bézier surfaces with prescribed border. An approximation to the solution of the Plateau-Bézier problem is obtained by replacing the area functional with the Dirichlet functional. Some comparisons betwe
An attractive method for approximating rational triangular Bézier surfaces by polynomial triangular Bézier surfaces is introduced. The main result is that the arbitrary given order derived vectors of a polynomial triangular surface converge uniformly to those of the approximated rational triangular