A new algorithm for line clipping against convex polyhedron is given. The suggested algorithmis faster for higher number of facets of the given polyhedron than the traditional Cyrus-Beck's andothers algorithms with complexity O(N) . The suggested algorithm has O(N) complexity in the worstcase and expected O(N) complexity. The speed up is achieved because of "known order" oftriangles. Some principal results of comparisons of selected algorithms are presented and give someimagination how the proposed algorithm could be used effectively.
展开▼
