Clipping (computer Graphics) - Algorithms

Algorithms

Several clipping algorithms have been devised.

• Line clipping algorithms:
  • Cohen–Sutherland
  • Liang–Barsky
  • Fast-clipping
  • Cyrus–Beck
  • Nicholl–Lee–Nicholl
  • Fast culling for 2D side-scrolling games
  • Skala
  • O(lg N) Algorithm

• Circle and B-Splines clipping algorithms;
  • Patrick-Gilles Maillot's Thesis on computer Graphics, pages 52 (circle), 53 (B-Splines) and respective algorithms pages 95 and 97.

• Polygon clipping algorithms:
  • Sutherland–Hodgman
  • Weiler–Atherton
  • Vatti
  • Patrick-Gilles Maillot 2D polygon clipping using integer or floating point - Sun Microsystems' patent #5079719, 1989.

• Polygon Structures clipping algorithms:
  • Triangle Strips and Quad-Meshes 3D Homogeneous Clipping (Patrick-Gilles Maillot)