Cohen–Sutherland (Rectangular Window Line Clipping)
Jump to navigation
Jump to search
Time Complexity
$O(n)$
Space Complexity
$O({1})$ words
(Easily derived (O(1) per segment, space can be re-used))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1967
Reference
https://books.google.com/books/about/Principles_of_interactive_computer_graph.html?id=inJ8AAAAIAAJ