Using a convex polygon with n edges to clip m lines,if n is sufficiently large,the experimental results have proved that the time used by the new algorithm is one third of that of the famous Cyrus-Beck algorithm.

• 实验结果表明,当n较大时,该算法所用的时间大约是著名的Cyrus-Beck算法所用时间的1/3左右。