A comparison of a new algorithm for line clipping in E2 and E3 by convex polygon and/or polyhedron with O(1) processing complexity and Cyrus- Beck algorithm is presented. The new algorithm in E2 is based on dual space representation and space subdivision technique. The principle of algorithm in E3 is based on the projection of polyhedron to three orthogonal E2 coordinate systems. Algorithms have optimal complexities O(1) and demonstrates that preprocessing can be used to speed up the line clipping significantly. Obvious applications are for one polygon and/or polyhedron and many clipped lines. Detailed theoretical estimations and experimental results are also presented.
翻译:E2中的新算法以双空间代表法和空间分区技术为基础,E3中算法的原则以多面体投射到三个正方形E2坐标系统为基础。 等离子体具有最佳的复杂度O(1), 并表明预处理可用于大大加快线切换速度。 很明显, E2中的新算法是针对一个多边形和/或多面体以及许多剪切线的应用。 还介绍了详细的理论估计和实验结果。