An Algorithm for Line Clipping by Convex Polyhedron in E3 with O(N1/2) Complexity
Václav Skala · Digital Library (University of West Bohemia) · 1994
A new algorithm for line clipping against convex polyhedron is given. The suggested algorithm is faster for higher number of facets of the given polyhedron than the traditional Cyrus-Beck's and others algorithms with complexity O(N). The suggested algorithm has O(N) complexity. The suggested algorithm has O(N) complexity in worst case and expected O(N1/2) complexity. The speed up is achieved because of "known order" of triangles. Some principal results of comparisons of selected algorithms are presented and give some idea how the proposed algorithm could be used effectively.