arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2208.04728cs.GR
收藏

一种新的直线与球面、直线与二次曲面求交方法

A New Approach to Line-Sphere and Line-Quadrics Intersection Detection and Computation

Vaclav Skala

摘要:

直线与凸多边形和非凸多边形的求交算法或多面体算法是众所周知的直线裁剪算法,并且在计算机图形学中非常常用。几何问题的渲染通常会导致光线追踪技术,当许多线与球体或二次曲面的相交是一个关键问题,由于光线跟踪算法的复杂性。提出了一种新的直线(射线)与二次曲面求交的检测和计算公式,该公式将直线和二次曲面的几何性质分离,从而实现预计算。该方法特别适合于SSE指令或GPU实现

英文摘要:

Line intersection with convex and un-convex polygons or polyhedron algorithms are well known as line clipping algorithms and very often used in computer graphics. Rendering of geometrical problems often leads to ray tracing techniques, when an intersection of many lines with spheres or quadrics is a critical issue due to ray-tracing algorithm complexity. A new formulation of detection and computation of the intersection of line (ray) with a quadric surface is presented, which separates geometric properties of the line and quadrics that enables pre-computation. The presented approach is especially convenient for implementation with SSE instructions or on GPU

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑