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

by   Vaclav Skala, et al.

A comparison of a new algorithm for line clipping in E2 and E3 by convex polygon and/or polyhedron with O(1) processing complexity and Cyrus- Beck algorithm is presented. The new algorithm in E2 is based on dual space representation and space subdivision technique. The principle of algorithm in E3 is based on the projection of polyhedron to three orthogonal E2 coordinate systems. Algorithms have optimal complexities O(1) and demonstrates that preprocessing can be used to speed up the line clipping significantly. Obvious applications are for one polygon and/or polyhedron and many clipped lines. Detailed theoretical estimations and experimental results are also presented.


page 14

page 15


Line Clipping in E3 with Expected Complexity O(1)

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

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

A New Algorithm based on Extent Bit-array for Computing Formal Concepts

The emergence of Formal Concept Analysis (FCA) as a data analysis techni...

O(lgN) Line Clipping Algorithm in E2

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

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

Dependency-Based Neural Representations for Classifying Lines of Programs

We investigate the problem of classifying a line of program as containin...