Clipping and Intersection Algorithms: Short Survey and References

2022/06/27 by Skala, Vaclav
#68U05 #68xx #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Graphics (cs.GR)

paper · doi:10.48550/arxiv.2206.13216

Abstract

This contribution presents a brief survey of clipping and intersection algorithms in E2 and E3 with a nearly complete list of relevant references. Some algorithms use the projective extension of the Euclidean space and vector-vector operations, which supports GPU and SSE use.

Related

• A Comparison of O(1) and Cyrus-Beck Line Clipping Algorithms in E2 and E3
• A simple en,ex marking rule for degenerate intersection points in 2D polygon clipping
• Clipping of Arbitrary Polygons with Degeneracies
• A Fast Algorithm for Line Clipping by Convex Polyhedron in E3
• Correcting self-intersecting polygons using minimal memory A simple and efficient algorithm and thoughts on line-segment intersection algorithms