A new algorithm is presented that generates developable Bézier surfaces through a Bézier curve called a directrix. The algorithm is based on differential geometry theory on necessary and sufficient condition...A new algorithm is presented that generates developable Bézier surfaces through a Bézier curve called a directrix. The algorithm is based on differential geometry theory on necessary and sufficient conditions for a surface which is developable, and on degree evaluation formula for parameter curves and linear independence for Bernstein basis. No nonlinear characteristic equations have to be solved. Moreover the vertex for a cone and the edge of regression for a tangent surface can be obtained easily. Aumann’s algorithm for developable surfaces is a special case of this paper.展开更多
Let D be an integer at least 3 and let H(D, 2) denote the hypercube. It is known that H(D, 2) is a Q-polynomial distance-regular graph with diameter D, and its eigenvalue sequence and its dual eigenvalue sequence are ...Let D be an integer at least 3 and let H(D, 2) denote the hypercube. It is known that H(D, 2) is a Q-polynomial distance-regular graph with diameter D, and its eigenvalue sequence and its dual eigenvalue sequence are all {D-2i}D i=0. Suppose that denotes the tetrahedron algebra. In this paper, the authors display an action of ■ on the standard module V of H(D, 2). To describe this action, the authors define six matrices in Mat X(C), called A, A*, B, B*, K, K*.Moreover, for each matrix above, the authors compute the transpose and then compute the transpose of each generator of ■ on V.展开更多
基金Project supported by the National Basic Research Program (973) of China (No. 2004CB719400), the National Natural Science Founda-tion of China (Nos. 60373033 and 60333010) and the National Natural Science Foundation for Innovative Research Groups (No. 60021201), China
文摘A new algorithm is presented that generates developable Bézier surfaces through a Bézier curve called a directrix. The algorithm is based on differential geometry theory on necessary and sufficient conditions for a surface which is developable, and on degree evaluation formula for parameter curves and linear independence for Bernstein basis. No nonlinear characteristic equations have to be solved. Moreover the vertex for a cone and the edge of regression for a tangent surface can be obtained easily. Aumann’s algorithm for developable surfaces is a special case of this paper.
基金supported by the National Natural Science Foundation of China(Nos.11471097,11271257)the Specialized Research Fund for the Doctoral Program of Higher Education of China(No.20121303110005)+1 种基金the Natural Science Foundation of Hebei Province(No.A2013205021)the Key Fund Project of Hebei Normal University(No.L2012Z01)
文摘Let D be an integer at least 3 and let H(D, 2) denote the hypercube. It is known that H(D, 2) is a Q-polynomial distance-regular graph with diameter D, and its eigenvalue sequence and its dual eigenvalue sequence are all {D-2i}D i=0. Suppose that denotes the tetrahedron algebra. In this paper, the authors display an action of ■ on the standard module V of H(D, 2). To describe this action, the authors define six matrices in Mat X(C), called A, A*, B, B*, K, K*.Moreover, for each matrix above, the authors compute the transpose and then compute the transpose of each generator of ■ on V.
