使用紧密、不相交的定界技术实现快速、高精度的光线/光纤相交
Fast, High Precision Ray/Fiber Intersection using Tight, Disjoint Bounding Volumes
摘要:
分析了现有的Bézier曲线上圆弧轮廓曲面上的光线与纤维求交细分方法的不足,提出了一种新的算法,提高了算法的精度和性能.代替使用重叠轴对齐的边界框和确定射线和曲线的最接近点的低效修剪,我们使用由圆柱体定义的不相交的边界体进行修剪,并计算极限曲面上的交点。这又允许计算精确的参数位置和交点中的法线。迭代每次细分只需要一位,以避免代价高昂的堆栈存储器操作。在一个低的细分数,高精度算法的性能是有竞争力的,而对于一个高的细分数,它显着优于国家的最先进的。除了广泛的数学分析,提供了源代码。
英文摘要:
Analyzing and identifying the shortcomings of current subdivision methods for finding intersections of rays with fibers defined by the surface of a circular contour swept along a Bézier curve, we present a new algorithm that improves precision and performance. Instead of the inefficient pruning using overlapping axis aligned bounding boxes and determining the closest point of approach of the ray and the curve, we prune using disjoint bounding volumes defined by cylinders and calculate the intersections on the limit surface. This in turn allows for computing accurate parametric position and normal in the point of intersection. The iteration requires only one bit per subdivision to avoid costly stack memory operations. At a low number of subdivisions, the performance of the high precision algorithm is competitive, while for a high number of subdivisions it dramatically outperforms the state-of-the-art. Besides an extensive mathematical analysis, source code is provided.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。