E2中的O(lgN)线裁剪算法
O(lgN) Line Clipping Algorithm in E2
摘要:
提出了一种新的O(lgN)的凸窗口E2直线裁剪算法。所提出的算法的主要优点是线裁剪问题的解决方案的主要加速。与其他算法的比较表明,在运行时间的显着改善。选定的已知算法的实验结果也示出。
英文摘要:
A new O(lg N) line clipping algorithm in E2 against a convex window is presented. The main advantage of the presented algorithm is the principal acceleration of the line clipping problem solution. A comparison of the proposed algorithm with others shows a significant improvement in run-time. Experimental results for selected known algorithms are also shown.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。