THE INTERSECTION OF A TRIANGULAR BEZIER PATCHAND A PLANE  

作　　者：Jernej Kozak 

机构地区：[1]Department of Mathematics University of Ljubljana, Slovenija

出　　处：《Journal of Computational Mathematics》1994年第2期138-146,共9页计算数学（英文）

基　　金：Supported by NSF and SF ofstate Education Commission of Chlna.Supported by the Ministry of Science and Technology of Slovenija.

摘　　要：In this paper, the problem of finding the intersection of a triangular Bezier patch and a plane is studied. For the degree that one frequently encounters in practice, i.e. n = 2,3, an efficient and reliable algorithm is obtained, and computational steps are presented.In this paper, the problem of finding the intersection of a triangular Bezier patch and a plane is studied. For the degree that one frequently encounters in practice, i.e. n = 2,3, an efficient and reliable algorithm is obtained, and computational steps are presented.

关 键 词：THE INTERSECTION OF A TRIANGULAR BEZIER PATCHAND A PLANE 

分 类 号：O182[理学—数学]