Cohen–Sutherland algorithm

The Cohen–Sutherland algorithm is a computer graphics algorithm used for line clipping. The algorithm divides a two-dimensional space into 9 regions (or a three-dimensional space into 27 regions), and then efficiently determines the lines and portions of lines that are visible in the center region of interest (the viewport).

The algorithm was developed in 1967 during flight simulator work by Danny Cohen and Ivan Sutherland.

See also

Algorithms used for the same purpose:

• Liang–Barsky
• Cyrus–Beck algorithm
• Nicholl–Lee–Nicholl
• Fast-clipping
• Sutherland–Hodgman algorithm

Other:

• Pathfinding (Shortest Path...)

Favorite site

• Wikipedia (en) Cohen–Sutherland algorithm에 대한 설명
• Cohen-Sutherland 알고리즘 ¹
• Viewing & Clipping - Cohen-Sutherland Line Clippings ²

References