Skala, Vaclav2014-10-212014-10-2119961467-8659https://doi.org/10.1111/1467-8659.1510061A new algorithm for clipping lines against convex polyhedron with O(N) complexity is given with modification for non-convex polyhedron. The suggested algorithm is faster for higher number of facets of the given polyhedron than the traditional Cyrus-Beck s algorithm. Some principal results of comparison of all algorithms are shown and give some ideas how the proposed algorithm could be used effectively.10.1111/1467-8659.151006161-68