In computer graphics, the Cohen-Sutherland algorithm is an algorithm used for line clipping. It divides a two-dimensional space into nine regions and efficiently determines the lines and portions of lines that are visible within the central region of interest, the viewport. The algorithm was developed in 1967 during flight simulator work by Danny Cohen and Ivan Sutherland.
Facts
Time Complexity
Time Complexity (category) Connections
Credited To
Source Cohen-Sutherland algorithm (Wikipedia)
Source Cohen-Sutherland algorithm (Wikipedia)
In Field
Source Cohen-Sutherland algorithm (Wikipedia)
Invented By
Danny Cohen co-developed this line-clipping algorithm with Ivan Sutherland in the early 1960s at Harvard.
Ivan Sutherland co-developed this line-clipping algorithm with Danny Cohen in the early 1960s at Harvard.
Source Wikipedia: Ivan Sutherland
Sources
1. Cohen-Sutherland Algorithm (Wikipedia)
Wikipedia infobox: time complexity constantQuote, Wikipedia infobox: time complexity constant
constant
Cohen-Sutherland algorithm (Wikipedia)
In Field: Algorithms and Complexity Theory, Lead sentence
Cohen-Sutherland algorithm is an algorithm used for line clipping.
In Group: Line Drawing and Clipping Algorithms, Lead section
algorithm used for line clipping
Credited To: Danny Cohen, Lead paragraph
The algorithm was developed in 1967 during flight simulator work by Danny Cohen and Ivan Sutherland.
Credited To: Ivan Sutherland, Lead paragraph
The algorithm was developed in 1967 during flight simulator work by Danny Cohen and Ivan Sutherland.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.