论文标题
E2中的两种新算法及其比较
Two New Algorithms for Line Clipping in E2 and Their Comparison
论文作者
论文摘要
许多用于通过矩形区域或E2中的凸多边形或E3中的非凸或凸多面体剪切的算法。 E2中矩形窗口剪辑的线段通常仅限于使用Cohen-Sutherland（CS）算法或基于某些假设（例如小型剪辑窗口或更复杂的编码技术等）的修改。但是，剪切问题解决方案是许多包装和应用程序，因此它是更复杂的，因此它是更复杂的，因此它是更奇怪的。
Many algorithms for clipping a line by a rectangular area or a convex polygon in E2 or by a non-convex or convex polyhedron in E3 have been published. The line segment clipping by the rectangular window in E2 is often restricted to the use of the Cohen-Sutherland (CS) algorithm or its modifications based on some presumptions like small clipping window or more sophisticated coding technique, etc. The line clipping problem solution is a bottleneck of many packages and applications and, therefore, it would be desirable to use the fastest algorithm even though it is more complex.
