Two new algorithms for line clipping in E2 and their comparison
V Skala, DH Bui - arXiv preprint arXiv:2201.00590, 2022 - arxiv.org
V Skala, DH Bui
arXiv preprint arXiv:2201.00590, 2022•arxiv.orgMany algorithms for clipping a line by a rectangular area or a convex polygon in E2 or by a
non-convex or convex polyhedron in E3 have been published. The line segment clipping by
the rectangular window in E2 is often restricted to the use of the Cohen-Sutherland (CS)
algorithm or its modifications based on some presumptions like small clipping window or
more sophisticated coding technique, etc. The line clipping problem solution is a bottleneck
of many packages and applications and, therefore, it would be desirable to use the fastest …
non-convex or convex polyhedron in E3 have been published. The line segment clipping by
the rectangular window in E2 is often restricted to the use of the Cohen-Sutherland (CS)
algorithm or its modifications based on some presumptions like small clipping window or
more sophisticated coding technique, etc. The line clipping problem solution is a bottleneck
of many packages and applications and, therefore, it would be desirable to use the fastest …
Many algorithms for clipping a line by a rectangular area or a convex polygon in E2 or by a non-convex or convex polyhedron in E3 have been published. The line segment clipping by the rectangular window in E2 is often restricted to the use of the Cohen-Sutherland (CS) algorithm or its modifications based on some presumptions like small clipping window or more sophisticated coding technique, etc. The line clipping problem solution is a bottleneck of many packages and applications and, therefore, it would be desirable to use the fastest algorithm even though it is more complex.
arxiv.org