A COMPARISON OF A NEW O(1) AND THE CYRUS-BECK LINE CLIPPING ALGORITHMS IN E 2
Václav Skala, Pavel Lederbuch · Digital Library (University of West Bohemia) · 1996
A comparison of a new algorithm for line clipping in E2 for convex polygons with O(1) processing complexity and the Cyrus-Beck algorithm is presented. The algorithm is based on the dual space representation and a space subdivision technique. The algorithm demonstrates that preprocessing can be used to speed up line clipping significantly. Theoretical analysis and detailed experimental results are also presented.