摘要
讨论双二、三次Ｂｅｚｉｅｒ片和平面相交的充分必要条件和求交的算法．其中双三次Ｂｅｚｉｅｒ片与平面相交的条件与最新文献的等价，证明却简单直观．并给出了两例．
This paper discusses the conditions for the intersection of a biqngdratic (bicubic) beter patch and a plane, and a necessary and sufficient condition for the intersection set to be not--empty is given, where, for the bicubic boier patch, the condition is equivalent to the latch resu lt, but the proof is very simple. Finally, the algorithm for finding the intersection and two examples is shown.
基金
国家自然科学基金
国家教委博士点基金
