The Intersection of a Triangular Bézier Patch and a Plane
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.
Published
1994-12-01
Abstract View
- 34462
Pdf View
- 3504
Issue
Section
Articles
How to Cite
The Intersection of a Triangular Bézier Patch and a Plane. (1994). Journal of Computational Mathematics, 12(2), 138-146. https://global-sci.com/index.php/JCM/article/view/11136