O(lg N) algorithm (convex polygonal window Line Clipping)
Jump to navigation
Jump to search
Time Complexity
$O(n*\log p)$
Space Complexity
$O({1})$ auxiliary?? 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
1994