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 ...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.展开更多
基金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.
