O(lg N) Line Clipping Algorithm in E2
Date issued
1994
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Pergamon Press
Abstract
A new O(lg N) line clipping algorithm in E2 against a convex window 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.
Description
Subject(s)
ořezávání přímky, konvexní polygon, počítačová grafika, složitost algoritmů
Citation
Computers and Graphics. 1994, vol. 18, no. 4, p. 517-524.