基于几何区间裁剪的求交算法-计算数学专业论文.docxVIP

摘 摘 要 摘 要 光线跟踪算法是真实感图形学中的主要算法之一，该算法具有原理简单、 实现方便和能够生成各种逼真的视觉效果等突出优点。 由于光线跟踪算法需要 用到大量的求交运算，因此求交运算的效率对整个算法的效率影响很大，光线 和物体的求交算法是光线跟踪算法的核心。 为了寻求简单、 快速稳定的求交算 法来实现光线跟踪加速三维场景渲染，本文对一种快速求交的新方法–几何区间 裁剪算法(GeoClip)进行了深入研究。 首先研究了计算两条平面曲线的几何裁剪算法，严格证明了几何区间裁 剪算法在计算多项式的根以及计算两条平面曲线的交点中都具有三阶收敛 性，该结果从理论上保证了几何区间裁剪算法优于经典的曲线求交算法-Be′zier Clipping算法。 最后对GeoClip与二次裁剪(QuadClip)算法进行了比较，结果表 明，虽然都是三阶收敛，但是GeoClip算法比二次裁剪算法要快30%左右。 然后将这种算法的优势推广到光线/三角曲面求交算法。 首先构造了以光线 为交线的两个垂直平面，将Be′zier曲面投影到R2。 投影后光线映射为坐标原点， 两个平面分别映为x，y轴。 从而，光线/曲面的求交问题转变为多项式的求根问 题，再利用GeoClip求根算法求出交点所在的参数区域。 最后给出了两种用于求 光线/三角曲面交点的算法–几何区间裁剪算法和Be′zier 裁剪算法的比较，结果表 明，几何区间裁剪算法优于Be′zier裁剪算法。 关 键 词： 曲线求交；方程求根；Be′zier裁剪；二次裁剪；几何区间裁剪；光 线/曲面求交；光线跟踪 III ABSTRA ABSTRACT ABSTRACT Ray tracing is one of the main algorithms in Realistic graphics, since it is simple in principle, convenient to implement and able to generate a variety of realistic visual effects. Since the main work of the ray tracing algorithm is to compute intersections between ray and objects, the intersection operation Efficiency of the algorithm has a great influence on the efficiency of ray tracing, and the ray/surfaces intersection algo- rithm is the core of ray tracing algorithm. In order to get a simple, yet fast and robust algorithm to achieve scene render by ray tracing, we make a further study of a novel algorithm –Geometric Interval Clipping to determine the intersections. Firstly we investigate curve/curve intersection and formally prove the convergence rate 3 both for computing all roots of a given univariate polynomial and the intersec- tions of two plane curves, which guarantees that the algorithm is better than the classic curves intersection algorithm-Be′zier clipping algorithm. We also provide the details of comparing result with quadratic clipping. Although both algorithms having con- vergence rate 3, the geometric interval clipping algorithm is about 30% faster than quadratic clipping algorithm. What’s more, we extend the method to compute the ray/surfaces intersect