首页   按字顺浏览 期刊浏览 卷期浏览 An Efficient Algorithm for Line Clipping by Convex and Non‐convex Polyhedra in E3
An Efficient Algorithm for Line Clipping by Convex and Non‐convex Polyhedra in E3

 

作者: Václav Skala,  

 

期刊: Computer Graphics Forum  （WILEY Available online 1996）
卷期: Volume 15, issue 1  

页码: 61-68

 

ISSN:0167-7055

 

年代: 1996

 

DOI:10.1111/1467-8659.1510061

 

出版商: Blackwell Science Ltd

 

关键词: Line clipping;convex polyhedron;non‐convex polyhedron;computer graphics;algorithm complexity;geometric algorithms;algorithms analysis

 

数据来源: WILEY

 

摘要:

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 effectiv

 

点击下载:  PDF (329KB)



返 回