Two New Algorithms for Line Clipping in E2 and Their Comparison

by   Vaclav Skala, et al.

Many algorithms for clipping a line by a rectangular area or a convex polygon in E2 or by a non-convex or convex polyhedron in E3 have been published. The line segment clipping by the rectangular window in E2 is often restricted to the use of the Cohen-Sutherland (CS) algorithm or its modifications based on some presumptions like small clipping window or more sophisticated coding technique, etc. The line clipping problem solution is a bottleneck of many packages and applications and, therefore, it would be desirable to use the fastest algorithm even though it is more complex.


page 1

page 2

page 3

page 4


O(lgN) Line Clipping Algorithm in E2

A new O(lg N) line clipping algorithm in E2 against a convex window is p...

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...

Strictly-Convex Drawings of 3-Connected Planar Graphs

Strictly-convex straight-line drawings of 3-connected planar graphs in s...

A New Algorithm for Pyramidal Clipping of Line Segments in E3

A new algorithm for clipping a line segment against a pyramid in E3 is p...

On-line Non-Convex Constrained Optimization

Time-varying non-convex continuous-valued non-linear constrained optimiz...

A new approach (extra vertex) and generalization of Shoelace Algorithm usage in convex polygon (Point-in-Polygon)

In this paper we aim to bring new approach into usage of Shoelace Algori...

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...