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
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
On the difficulty of finding reliable witnesses
ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
An Analysis Technique and an Algorithm for Line Clipping
IV '98 Proceedings of the International Conference on Information Visualisation
Computer Graphics with OpenGL
Analysis of the nicholl-lee-nicholl algorithm
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
| Hi-index | 0.00 |
The Nicholl-Lee-Nicholl (NLN) algorithm for clipping line segments against a rectangular window in the plane (Computer Graphics21,4 pp 253–262) was proved to be optimal recently in terms of the minimum and maximum number of comparisons and the number of predicates used. A new algorithm is proposed that does not use predicates, but calculates intersections speculatively. Surprisingly, this approach not only leads to a much simpler algorithm, but also takes fewer operations in many cases, including the worst case. It is proved that the new algorithm never takes more operations than the optimal algorithm. Experimental results demonstrate that the new algorithm is 80% to 560% faster than long-established, widely known algorithms.