Clipping and Intersection Algorithms: Short Survey and References

TL;DR

This paper provides a concise survey of clipping and intersection algorithms in 2D and 3D, highlighting methods that leverage projective extensions and vector operations suitable for GPU acceleration.

Contribution

It offers a nearly complete reference list and discusses algorithms using projective extensions and vector operations for efficient computation.

Findings

Comprehensive overview of clipping and intersection algorithms in 2D and 3D.

Identification of algorithms supporting GPU and SSE implementations.

Summary of methods using projective extensions of Euclidean space.

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.