| dc.contributor.author | Skala, Vaclav | en_US |
| dc.date.accessioned | 2014-10-21T07:41:34Z | |
| dc.date.available | 2014-10-21T07:41:34Z | |
| dc.date.issued | 1996 | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1111/1467-8659.1510061 | en_US |
| dc.description.abstract | 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 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.publisher | Blackwell Science Ltd and the Eurographics Association | en_US |
| dc.title | An Efficient Algorithm for Line Clipping by Convex and Non-convex Polyhedra in E3 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 15 | en_US |
| dc.description.number | 1 | en_US |
| dc.identifier.doi | 10.1111/1467-8659.1510061 | en_US |
| dc.identifier.pages | 61-68 | en_US |
