Principles of interactive computer graphics (2nd ed.)
Principles of interactive computer graphics (2nd ed.)
A New Concept and Method for Line Clipping
ACM Transactions on Graphics (TOG)
Syntactic source to source transforms and program manipulation
Communications of the ACM
Performing geometric transformations by program transformation
ACM Transactions on Graphics (TOG)
A new, fast method for 2D polygon clipping: analysis and software implementation
ACM Transactions on Graphics (TOG)
Analysis of the nicholl-lee-nicholl algorithm
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
A speculative approach to clipping line segments
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Hi-index | 0.00 |
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.