ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

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

Sharma, NC and Manohar, S (1992) Line clipping revisited: Two efficient algorithms based on simple geometric observations. In: Computers & Graphics, 16 (1). pp. 51-54.

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1016/0097-8493(92)90071-3

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.

Item Type: Journal Article
Additional Information: Copyright of this article belongs to Elsevier science.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Division of Mechanical Sciences > Mechanical Engineering
Date Deposited: 05 May 2011 06:29
Last Modified: 05 May 2011 06:29
URI: http://eprints.iisc.ernet.in/id/eprint/37194

Actions (login required)

View Item View Item