Line Clipping in E3 with Expected Complexity O(1)
Computational Geometry
2022-01-04 v1
Abstract
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.
Cite
@article{arxiv.2201.00592,
title = {Line Clipping in E3 with Expected Complexity O(1)},
author = {Vaclav Skala},
journal= {arXiv preprint arXiv:2201.00592},
year = {2022}
}
Comments
arXiv admin note: text overlap with arXiv:2111.07987