E3中线段金字塔裁剪的新算法
A New Algorithm for Pyramidal Clipping of Line Segments in E3
摘要:
提出了一种新的E3中对金字塔进行直线裁剪的算法。该算法避免了计算非端点的交点。它还可以更有效地解决所有问题。该算法的性能被证明是一贯优于现有的算法,包括科恩-萨瑟兰,梁-Barsky和Cyrus-Beck算法。
英文摘要:
A new algorithm for clipping a line segment against a pyramid in E3 is presented. This algorithm avoids computation of intersection points which are not end-points of the output line segment. It also allows solving all cases more effectively. The performance of this algorithm is shown to be consistently better than existing algorithms, including the Cohen-Sutherland, Liang-Barsky and Cyrus-Beck algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。