An Efficient Algorithm for Line Clipping by Convex and Non-convex Polyhedra in E3
View/
Date
1996Pay-Per-View via TIB Hannover:
Try if this item/paper is available.
Metadata
Show full item recordAbstract
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.
BibTeX
@article {10.1111:1467-8659.1510061,
journal = {Computer Graphics Forum},
title = {{An Efficient Algorithm for Line Clipping by Convex and Non-convex Polyhedra in E3}},
author = {Skala, Vaclav},
year = {1996},
publisher = {Blackwell Science Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/1467-8659.1510061}
}
journal = {Computer Graphics Forum},
title = {{An Efficient Algorithm for Line Clipping by Convex and Non-convex Polyhedra in E3}},
author = {Skala, Vaclav},
year = {1996},
publisher = {Blackwell Science Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/1467-8659.1510061}
}