E3中凸多面体直线裁剪的快速算法
A Fast Algorithm for Line Clipping by Convex Polyhedron in E3
摘要:
提出了一种新的凸多面体直线裁剪算法。该算法比传统的Cyrus-Beck算法和其他算法在复杂度为O(N)的情况下,对多面体的面数较多时速度更快。该算法在最坏N情况下的复杂度为O(N),期望复杂度为O(sqrt(N)).由于三角形的“已知顺序”,实现了速度的提高。给出了所选算法的一些主要比较结果,并对如何有效地使用所提出的算法给出了一些设想。
英文摘要:
A new algorithm for line clipping against convex polyhedron is given. The suggested algorithm is faster for higher number of facets of the given polyhedron than the traditional Cyrus-Beck's and others algorithms with complexity O(N) . The suggested algorithm has O(N) complexity in the worst N case and expected O(sqrt(N))) complexity. The speed up is achieved because of 'known order' of triangles. Some principal results of comparisons of selected algorithms are presented and give some imagination how the proposed algorithm could be used effectively.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。