English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The majority of methods for line clipping make a rather large number ofcomparisons and involve a lot of calculations compared to modern ones. Most ofthe times, they are not so efficient as well as not so simple and applicable tothe majority of cases. Besides the most popular ones, namely, Cohen-Sutherland,Liang-Barsky, Cyrus-Beck and Nicholl-Lee-Nicholl, other line-clipping methodshave been presented over the years, each one having its own advantages anddisadvantages. In this paper a new computation method for 2D line clippingagainst a rectangular window is introduced. The proposed method has beencompared with the afore-mentioned ones as well as with two others; namely,Skala and Kodituwakku-Wijeweera-Chamikara, with respect to the number ofoperations performed and the computation time. The performance of the proposedmethod has been found to be better than all of the above-mentioned methods andit is found to be very fast, simple and can be implemented easily in anyprogramming language or integrated development environment.

Another Simple but Faster Method for 2D Line Clipping