In:
ACM SIGGRAPH Computer Graphics, Association for Computing Machinery (ACM), Vol. 21, No. 4 ( 1987-08), p. 253-262
Abstract:
This paper describes a new alorithm for clipping a line in two dimensions against a rectangular window. This algorithm avoids computation of intersection points which are not endpoints of the output line segment. The performance of this algorithm is shown to be consistently better than existing algorithms, including the Cohen-Sutherland and Liang-Barsky algorithms. This performance comparison is machine-independent, based on an analysis of the number of arithmetic operations and comparisons required by the different algorithms. We first present the algorithm using procedures which perform geometric transformations to exploit symmetry properties and then show how program transformation techniques may be used to eliminate the extra statements involved in performing geometric transformations.
Type of Medium:
Online Resource
ISSN:
0097-8930
Language:
English
Publisher:
Association for Computing Machinery (ACM)
Publication Date:
1987
detail.hit.zdb_id:
2088979-3
detail.hit.zdb_id:
282142-4
