Now showing items 1-1 of 1
An Efficient Algorithm for Line Clipping by Convex and Non-convex Polyhedra in E3
(Blackwell Science Ltd and the Eurographics Association, 1996)
A 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 ...