2021/11/15 by Václav Skala, Skala, Vaclav, Pavel Lederbuch +4
Computer Science · Engineering · #Advanced Numerical Analysis Techniques #Advanced Surface Polishing Techniques #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Graphics (cs.GR)
paper · pdf · doi:10.48550/arxiv.2111.07987
openalex publication_date 2021/11/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A comparison of a new algorithm for line clipping in E2 and E3 by convex\npolygon and/or polyhedron with O(1) processing complexity and Cyrus- Beck\nalgorithm is presented. The new algorithm in E2 is based on dual space\nrepresentation and space subdivision technique. The principle of algorithm in\nE3 is based on the projection of polyhedron to three orthogonal E2 coordinate\nsystems. Algorithms have optimal complexities O(1) and demonstrates that\npreprocessing can be used to speed up the line clipping significantly. Obvious\napplications are for one polygon and/or polyhedron and many clipped lines.\nDetailed theoretical estimations and experimental results are also presented.\n