An Improved Cohen-Sutherland Region Encoding Algorithm

Abstract:

Through the arduous study of the famous Cohen-Sutherland algorithm, this paper proposes a novel improved algorithm by analyzing its main flaw in efficiency. The line segment without the clipping window will be rejected in our algorithm. By means of adding auxiliary straight-line, this algorithm efficiently calculates intersection points between line and the boundary of clipping window. Thus, this improved algorithm is simple, improving its clipping efficiency and reaching the desired results.

• Periodical: Applied Mechanics and Materials (Volumes 239-240)
• Pages: 1313-1317
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.239-240.1313
• Online since: December 2012
• Authors: Wei Wei, Pei Hua Ma, Wei Lin
• Keywords: Cohen-Sutherland Algorithm, Computer Graphics (CG), Line Clipping, Rectangular Window

References

[1] Donald Hearn and M. Pauline Baker: Computer Graphics with OpenGL 3rd Edition, Publishing House of Electronics Industry, Beijing (2005), p.259.

[2] Y.D. Liang and B.A. Barsky: Transactions on Graphics, Vol. 3 (1984), p.1.

[3] T.M. Nicholl, D.T. Lee and R.A. Nicholl: Computer Graphic, Vol. 4 (1987), p.253.

[4] Jun Wang, Youdong Liang and Qunsheng Peng: Journal of Computers, Vol. 7 (1991), p.495 (in Chinese).

[5] Haohong Wang, Ruixun Wu and Shijie Cai: Journal of Software, Vol. 9 (1998), p.728 (in Chinese).

[6] Zhulin Li and Gang: Computer Engineering and Applications, (2011), in press (in Chinese).

[7] Li Zhong and Yanping Ma: Journal of Engineering Graphics, Vol. 5 (2009), p.49 (in Chinese).