Line Clipping in E2 with O(1) Processing Complexity
Date issued
1996
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Abstract
A new algorithm for line clipping by convex polygon with O(1) processing
complexity is presented. It is based on dual space representation and space subdivision
technique. The suggested algorithm also demonstrates that pre-processing can be used in
order to speed up solution of some problems in computer graphics applications significantly.
Theoretical considerations and experimental results are also presented.
Description
Subject(s)
ořezávání přímek, konvexní polygon, počítačová grafika, složitost algoritmů, geometrické algoritmy
Citation
Computers and Graphics. 1996, vol. 20, is. 4, p. 523-530.