O(lgN) Line Clipping Algorithm in E2
Graphics
2018-01-03 v1
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.
Cite
@article{arxiv.1801.00442,
title = {O(lgN) Line Clipping Algorithm in E2},
author = {Vaclav Skala},
journal= {arXiv preprint arXiv:1801.00442},
year = {2018}
}