An Efficient Line Clipping Algorithm on a Rectangular Window


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 2, No. 2, pp. 247-253, Mar. 1995
10.3745/KIPSTE.1995.2.2.247,   PDF Download:

Abstract

An efficient algorithm for clipping 2D lines on a rectangular window is proposed. It is suitable for displaying images consisted of many lines for it can reduce the number of arithmetic and logical operations. The algorithm is compared which the Cohen-Sutherland algorithm and it was proved to be efficient.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. E. Kon, H. Y. Nam, L. W. Ki, "An Efficient Line Clipping Algorithm on a Rectangular Window," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 2, no. 2, pp. 247-253, 1995. DOI: 10.3745/KIPSTE.1995.2.2.247.

[ACM Style]
Kim Eung Kon, Heo Young Nam, and Lee Woong Ki. 1995. An Efficient Line Clipping Algorithm on a Rectangular Window. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 2, 2, (1995), 247-253. DOI: 10.3745/KIPSTE.1995.2.2.247.