一种简单快速的二维直线裁剪方法
Another Simple but Faster Method for 2D Line Clipping
摘要:
与现代的方法相比,大多数的线裁剪方法进行了大量的比较,并涉及大量的计算。大多数时候,它们不是那么有效,也不是那么简单,适用于大多数情况。除了最流行的几种线裁剪方法,即Cohen-Sutherland、Liang-Barsky、Cyrus-Beck和Nicholl-Lee-Nicholl之外,其他的线裁剪方法也被提出来,每一种都有自己的优点和缺点。本文介绍了一种新的矩形窗口二维直线裁剪计算方法。所提出的方法进行了比较,与上述的,以及与其他两个,即斯卡拉和Kodituwakku-Wijeweera-Chamikara,相对于所执行的操作的数量和计算时间。所提出的方法的性能已被发现是优于所有上述方法,它被发现是非常快速,简单,可以很容易地实现在任何程序设计语言或集成开发环境。
英文摘要:
The majority of methods for line clipping make a rather large number of comparisons and involve a lot of calculations compared to modern ones. Most of the times, they are not so efficient as well as not so simple and applicable to the majority of cases. Besides the most popular ones, namely, Cohen-Sutherland, Liang-Barsky, Cyrus-Beck and Nicholl-Lee-Nicholl, other line-clipping methods have been presented over the years, each one having its own advantages and disadvantages. In this paper a new computation method for 2D line clipping against a rectangular window is introduced. The proposed method has been compared with the afore-mentioned ones as well as with two others; namely, Skala and Kodituwakku-Wijeweera-Chamikara, with respect to the number of operations performed and the computation time. The performance of the proposed method has been found to be better than all of the above-mentioned methods and it is found to be very fast, simple and can be implemented easily in any programming language or integrated development environment.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。