×

Triangular Bézier sub-surfaces on a triangular Bézier surface. (English) Zbl 1232.65029

The authors provide a more convenient method for computing the Bézier representation for a triangular sub-patch on a triangular Bézier surface. An explicit compact formula to compute the control points of the composition is deduced. The authors simplify the formula to express the control points of the triangular Bézier sub-patch as linear combinations of the blossoming points that correspond to distinct construction points. Their algorithm results in a set of blossoming points considerably less numerous than that of construction points. The paper contains detailed algorithms presented for practical users, together with numerical examples.

MSC:

65D17 Computer-aided design (modeling of curves and surfaces)
68U07 Computer science aspects of computer-aided design
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] DeRose, T., Composing Bézier simplexes, ACM Transactions on Graphics, 7, 3, 221 (1988) · Zbl 0657.65027
[2] Jüttler, B.; Wang, W., The shape of spherical quartics, Computer Aided Geometric Design, 20, 8-9, 621-636 (2003) · Zbl 1069.41505
[3] Hu, S.; Wang, G.; Jin, T., Generalized subdivision of Bézier surfaces, Graphical Models and Image Processing, 58, 3, 218-222 (1996)
[4] Boehm, W.; Farin, G., Concerning subdivision of bézier triangles, letter to the editor, Computer-Aided Design, 15, 5, 260-261 (1983)
[5] Böhm, W.; Farin, G.; Kahmann, J., A survey of curve and surface methods in CAGD, Computer Aided Geometric Design, 1, 1, 1-60 (1984) · Zbl 0604.65005
[6] Goldman, R., Subdivision algorithms for Bézier triangles, Computer-Aided Design, 15, 3, 159-166 (1983)
[7] H. Seidel, A general subdivision theorem for Bézier triangles, Mathematical Methods in Computer Aided Geometric Design, pp. 573-581.; H. Seidel, A general subdivision theorem for Bézier triangles, Mathematical Methods in Computer Aided Geometric Design, pp. 573-581.
[8] Brueckner, I., Construction of Bézier points of quadrilaterals from those of triangles, Computer-Aided Design, 12, 1, 21-24 (1980)
[9] Waggenspack, W.; Anderson, D., Converting standard bivariate polynomials to Bernstein form over arbitrary triangular regions, Computer-Aided Design, 18, 10, 529-532 (1986)
[10] Jie, T., A geometric condition for smoothness between adjacent rational Bézier surfaces, Computers in Industry, 13, 4, 355-360 (1990)
[11] Goldman, R.; Filip, D., Conversion from Bézier rectangles to Bézier triangles, Computer-Aided Design, 19, 1, 25-27 (1987) · Zbl 0655.65023
[12] Hu, S., Conversion of a triangular Bézier patch into three rectangular Bézier patches, Computer Aided Geometric Design, 13, 3, 219-226 (1996) · Zbl 0900.68406
[13] Sheng, X.; Hirsch, B., Triangulation of trimmed surfaces in parametric space, Computer-Aided Design, 24, 8, 437-444 (1992) · Zbl 0756.65168
[14] DeRose, T.; Goldman, R.; Hagen, H.; Mann, S., Functional composition algorithms via blossoming, ACM Transactions on Graphics (TOG), 12, 2, 113-135 (1993) · Zbl 0771.68100
[15] Lasser, D., Tensor product Bézier surfaces on triangle Bézier surfaces, Computer Aided Geometric Design, 19, 8, 625-643 (2002)
[16] Lasser, D., Triangular subpatches of rectangular Bézier surfaces, Computers & Mathematics with Applications, 55, 1706-1719 (2008) · Zbl 1139.65011
[17] Feng, J.; Peng, Q., Functional compositions via shifting operators for Bézier patches and their applications, Chinese Journal of Software, 10, 12, 1316-1322 (1999)
[18] Farm, G., Triangular Bernstein-Bézier patches, Computer Aided Geometric Design, 3, 83-127 (1986)
[19] Chang, G., Bernstein polynomials via the shifting operator, American Mathematical Monthly, 91, 10, 634-638 (1984) · Zbl 0563.41007
[20] Farin, G.; Farin, G., Curves and Surfaces for CAGD: A Practical Guide (2002), Morgan Kaufmann Pub. · Zbl 0835.65020
[21] Chang, G.; Davis, P., The convexity of Bernstein polynomials over triangles, Journal of Approximation Theory, 40, 1, 11-28 (1984) · Zbl 0528.41005
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.