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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。