New Fast Line Clipping Algorithm in E2 With O(IgN) Complexity
Date issued
1999
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Univerzita Komenského
Abstract
New faster line clipping algorithm in E2 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.
Description
Subject(s)
algoritmy, počítačová grafika, komplexita algoritmů, konvexní polygon
Citation
Spring Conference on Computer Graphics SCCG 1999: Conference Proceedings, p. 221-228.