论文标题
在E3中剪切，具有预期复杂性o（1）
Line Clipping in E3 with Expected Complexity O(1)
论文作者
论文摘要
提出了一种针对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.
