Convergence analysis and comparison for geometric interval clipping
In order to develop a simple, yet fast and robust algorithm to accelerate the intersection calculation of ray tracing, we make a deep study on the convergence of geometric interval clipping. We formally prove its 3rd order convergence for computing all roots of a given univariate polynomial and for calculating the intersections of two plane curves, which guarantees its better performance than Bézier clipping algorithm. We also provide the comparison against quadratic clipping. Although both algorithms exhibit the 3rd order convergence, the geometric interval clipping algorithm is about 30% faster than quadratic clipping algorithm.
Publication Source (Journal or Book title)
Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics
Liu, H., & Li, X. (2010). Convergence analysis and comparison for geometric interval clipping. Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 22 (12), 2250-2258. Retrieved from https://digitalcommons.lsu.edu/eecs_pubs/792