AN ENHANCEMENT OF COHEN -SUTHERLAND ALGORITHM FOR LINE CLIPPING BY REDUCING NEEDLESS CLIPPING

M.A.  Rahman; S.K.  Islam; S.M.R.  Haque; M.K.  Islam

doi:10.53808/KUS.2001.3.2.0156-se

Authors

M.A. Rahman Computer Science and Engineering Discipline. Khulna University
S.K. Islam Computer Science and Engineering Discipline. Khulna University
S.M.R. Haque Computer Science and Engineering Discipline. Khulna University
M.K. Islam Computer Science and Engineering Discipline. Khulna University

DOI:

https://doi.org/10.53808/KUS.2001.3.2.0156-se

Keywords:

Line clipping, clipping candidate, needless clipping, clipping window

Abstract

Cohen-Sutherland Algorithm is a very well known algorithm in computer graphics for line clipping. In this algorithm the clipping region is divided into nine regions. In our proposed algorithm we have proposed an algorithm which divides the clipping region into five regions. This modified algorithm is faster than Cohen-Sutherland algorithm in many cases. We have presented our algorithm and given comparison between Cohen-Sutherland Algorithm with ours.

Downloads

Download data is not yet available.

References

Xiang, Z„and Plastock, R. A., 2001. Computer Graphics, McGraw-Hill, New York, 2nd ed.

Foley, J. D., Van Dam, A., Feiner, S. K. and Hughes, J.F., 1999. Computer Graphics Principles and Practice, 2d. ed, Adision Wesley Longman Singapore, Reading MA.

Skala, V., 1993. An efficient algorithm by convex polygon, its development Computer & Graphics 17(4),pp.417-421.

Haque, M. M„Khan T.I., Tarafdar.A.H., 2001. Study and Development of a line clipping algorithm, B.Sc. Thesis, CSE Discipline, Khulna University, Khulna, Bangladesh.

Sharma, N.C. and Manohar, S.,1992. Two efficient algorithms based on simple geometric observations, its development Computer & Graphics 16(1), 51-54.

Andreev, R„and Sofianska, E.,1991. its development Computer & Graphics 15(4), pp.519-526.

Nicholl, T. M., Lee. D. T. and Nicholl, R. A.1987. An efficient new algorithm for 2-D line clipping : its development and analysis Computer & Graphics 21(4), 253-262.