Technical section
Line clipping revisited: Two efficient algorithms based on simple geometric observations

https://doi.org/10.1016/0097-8493(92)90071-3Get rights and content

Abstract

Two new line clipping algorithms, the opposite-corner algorithm and the perpendicular-distance algorithm, that are based on simple geometric observations are presented. These algorithms do not require computation of outcodes nor do they depend on the parametric representations of the lines. It is shown that the opposite-corner algorithm perform consistently better than an algorithm due to Nicholl, Lee, and Nicholl which is claimed to be better than the classic algorithm due to Cohen-Sutherland and the more recent Liang-Barsky algorithm. The pseudo-code of the opposite-corner algorithm is provided in the Appendix.

References (3)

  • Y.D. Liang et al.

    A new concept and method for line clipping

    ACM Transactions on Graphics

    (July 1984)
There are more references available in the full text version of this article.

Cited by (11)

View all citing articles on Scopus
View full text