An efficient new algorithm for 2-D line clipping: Its development and analysis
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Performing geometric transformations by program transformation
ACM Transactions on Graphics (TOG)
Computer graphics (2nd ed. in C): principles and practice
Computer graphics (2nd ed. in C): principles and practice
A New Concept and Method for Line Clipping
ACM Transactions on Graphics (TOG)
A Trip Down the Graphics Pipeline: Line Clipping
IEEE Computer Graphics and Applications
An Analysis Technique and an Algorithm for Line Clipping
IV '98 Proceedings of the International Conference on Information Visualisation
Computer Graphics with OpenGL
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 |
The algorithm proposed by Nicholl, Lee and Nicholl (Computer Graphics21,4 pp 253–262) for clipping line segments against a rectangular window in the plane is proved to be optimal in terms of the minimum and maximum number of comparisons and the number of predicates used. It is also demonstrated that, due to its overhead, the algorithm in its compact form is slightly slower than simple algorithms. Though Nicholl et al proposed program-transformation techniques to expand the code to exploit the full potential of the algorithm, in some cases it takes more operations than simple algorithms, e.g., two intersections and three predicates instead of four intersections. While the algorithm is optimal on its own terms, it solves the clipping problem with the added restriction that only valid intersections are allowed to be calculated.