A New Algorithm for Pyramidal Clipping of Line Segments in E3
Computational Geometry
2022-01-04 v1 Graphics
Abstract
A new algorithm for clipping a line segment against a pyramid in E3 is presented. This algorithm avoids computation of intersection points which are not end-points of the output line segment. It also allows solving all cases more effectively. The performance of this algorithm is shown to be consistently better than existing algorithms, including the Cohen-Sutherland, Liang-Barsky and Cyrus-Beck algorithms.
Keywords
Cite
@article{arxiv.2201.00587,
title = {A New Algorithm for Pyramidal Clipping of Line Segments in E3},
author = {Vaclav Skala and Duc Huy Bui},
journal= {arXiv preprint arXiv:2201.00587},
year = {2022}
}