New efficient algorithms for the line clipping by the given rectangle in E2 are presented. The first algorithm is based on the line direction evaluation, the second one is based on a new coding technique of clipping rectangle’s vertices. It allows solving all cases more effectively. A comparison of the proposed algorithms with the Liang-Barsky algorithm and some experimental results are presented, too
A new algorithm for clipping a line segment against a pyramid in E3 is presented. This algorithm a...
A new algorithm for line clipping against convex polyhedron is given. The suggested algorithm is fas...
An improved parametric line clipping algorithm is presented. The line clipping algorithm is extended...
New modifications of the Cohen-Sutherland algorithm for the line and line segment clipping in E2 are...
New faster line clipping algorithm in E2 against a convex polygon with O(lgN) complexity is presente...
A comparison of a new algorithm for line clipping in E2 for convex polygons with O(1) processing com...
A comparative study of new line clipping algorithms for 2D complex polygons is presented and the eva...
A new O(lg N) line clipping algorithm in E2 against a convex window is presented. The main advantage...
A new O(lg N) line clipping algorithm in E2 against a convex window is presented. The main advantage...
A comparison of a new algorithm for line clipping in E2 and E3 by convex polygon and/or polyhedron w...
Two new line clipping algorithms, the opposite-corner algorithm and the perpendicular-distance algor...
The most popular lines clipping algorithms are Cohen-Sutherland and Liang-Barsky line clipping algor...
Clipping, as a fundamental process in computer graphics, displays only the part of a scene which is ...
A new concept and method for line clipping is developed that describes clipping in an exact and math...
A new algorithm for line clipping by convex polygon with O(1) processing complexity is presented. It...
A new algorithm for clipping a line segment against a pyramid in E3 is presented. This algorithm a...
A new algorithm for line clipping against convex polyhedron is given. The suggested algorithm is fas...
An improved parametric line clipping algorithm is presented. The line clipping algorithm is extended...
New modifications of the Cohen-Sutherland algorithm for the line and line segment clipping in E2 are...
New faster line clipping algorithm in E2 against a convex polygon with O(lgN) complexity is presente...
A comparison of a new algorithm for line clipping in E2 for convex polygons with O(1) processing com...
A comparative study of new line clipping algorithms for 2D complex polygons is presented and the eva...
A new O(lg N) line clipping algorithm in E2 against a convex window is presented. The main advantage...
A new O(lg N) line clipping algorithm in E2 against a convex window is presented. The main advantage...
A comparison of a new algorithm for line clipping in E2 and E3 by convex polygon and/or polyhedron w...
Two new line clipping algorithms, the opposite-corner algorithm and the perpendicular-distance algor...
The most popular lines clipping algorithms are Cohen-Sutherland and Liang-Barsky line clipping algor...
Clipping, as a fundamental process in computer graphics, displays only the part of a scene which is ...
A new concept and method for line clipping is developed that describes clipping in an exact and math...
A new algorithm for line clipping by convex polygon with O(1) processing complexity is presented. It...
A new algorithm for clipping a line segment against a pyramid in E3 is presented. This algorithm a...
A new algorithm for line clipping against convex polyhedron is given. The suggested algorithm is fas...
An improved parametric line clipping algorithm is presented. The line clipping algorithm is extended...