An Efficient Algorithm for Line Clipping by Convex and Non-convex Polyhedra in E3

Simple item page
dc.contributor.authorSkala, Vaclaven_US
dc.date.accessioned2014-10-21T07:41:34Z
dc.date.available2014-10-21T07:41:34Z
dc.date.issued1996en_US
dc.description.abstractA 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.en_US
dc.description.number1en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume15en_US
dc.identifier.doi10.1111/1467-8659.1510061en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages61-68en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.1510061en_US
dc.publisherBlackwell Science Ltd and the Eurographics Associationen_US
dc.titleAn Efficient Algorithm for Line Clipping by Convex and Non-convex Polyhedra in E3en_US
Files
Collections
Issue 1