New Fast Line Clipping Algorithm in E 2 with O(lgN) Complexity
Bui Duc Huy, Václav Skala · 1999
New faster line clipping algorithm in E 2 against a convex polygon with O(lgN) complexity is presented. The main advantage of the presented algorithm is the principal acceleration of the line clipping problem solution. A comparison of the proposed algorithm with others shows a significant improvement in run-time. Experimental results for selected known algorithms are also shown.