Year: 1994
Author: Fa-Lai Chen, Jernej Kozak
Journal of Computational Mathematics, Vol. 12 (1994), Iss. 2 : pp. 138–146
Abstract
In this paper, the problem of finding the intersection of a triangular Bézier 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.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1994-JCM-9283
Journal of Computational Mathematics, Vol. 12 (1994), Iss. 2 : pp. 138–146
Published online: 1994-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 9