arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2201.00592cs.CG
收藏

期望复杂度为O(1)的E3中的线裁剪

Line Clipping in E3 with Expected Complexity O(1)

Vaclav Skala

摘要:

提出了一种新的E3中凸多面体的线裁剪算法,其预期复杂度为O(1)。建议的方法是基于两个正交投影到E2坐标系和给定的多面体的预处理。预处理能够显著加快解决方案。该方法适用于常凸多面体上多条直线的裁剪问题。理论上的考虑和实验结果也提出。

英文摘要:

A new line clipping algorithm against convex polyhedron in E3 with an expected complexity O(1) is presented. The suggested approach is based on two orthogonal projections to E2 co-ordinate system and on pre-processing of the given polyhedron. The pre-processing enables to speed up solution significantly. The proposed method is convenient for those applications when many lines are clipped against constant convex polyhedron. Theoretical considerations and experimental results are also presented.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑