Liang–Barsky (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
1984
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/357332.357333