O(lgN) Line Clipping Algorithm in E2

by   Vaclav Skala, et al.

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.


page 1

page 2

page 3

page 4


A Fast Algorithm for Line Clipping by Convex Polyhedron in E3

A new algorithm for line clipping against convex polyhedron is given. Th...

Two New Algorithms for Line Clipping in E2 and Their Comparison

Many algorithms for clipping a line by a rectangular area or a convex po...

Another Simple but Faster Method for 2D Line Clipping

The majority of methods for line clipping make a rather large number of ...

Line Clipping in E3 with Expected Complexity O(1)

A new line clipping algorithm against convex polyhedron in E3 with an ex...

A Novel Point Inclusion Test for Convex Polygons Based on Voronoi Tessellations

The point inclusion tests for polygons, in other words the point-in-poly...

A Comparison of O(1) and Cyrus-Beck Line Clipping Algorithms in E2 and E3

A comparison of a new algorithm for line clipping in E2 and E3 by convex...

Integrative Windowing

In this paper we re-investigate windowing for rule learning algorithms. ...