کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4639951 | 1341254 | 2011 | 16 صفحه PDF | دانلود رایگان |

This paper considers the problem of computing the Bézier representation for a triangular sub-patch on a triangular Bézier surface. The triangular sub-patch is defined as a composition of the triangular surface and a domain surface that is also a triangular Bézier patch. Based on de Casteljau recursions and shifting operators, previous methods express the control points of the triangular sub-patch as linear combinations of the construction points that are constructed from the control points of the triangular Bézier surface. The construction points contain too many redundancies. This paper derives a simple explicit formula that computes the composite triangular sub-patch in terms of the blossoming points that correspond to distinct construction points and then an efficient algorithm is presented to calculate the control points of the sub-patch.
Journal: Journal of Computational and Applied Mathematics - Volume 235, Issue 17, 1 July 2011, Pages 5001–5016