An Efficient Algorithm for Line Clipping by Convex and Non-covex Polyhedrons in E3
Date issued
1996
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Wiley
Abstract
A new algorithm for clipping lines againts 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 imagination how the proposed algorithm could be used effectively.
Description
Subject(s)
ořezávání přímek, mnohostěny, počítačová grafika, složitost algoritmů, geometrické algoritmy, analýza algoritmů
Citation
Computer Graphics Forum. 1996, vol. 15, is. 1, p. 61-68.