Cyrus–Beck (Convex Polygonal Window; Convex Polyhedral window Line Clipping)
Jump to navigation
Jump to search
Time Complexity
$O(np)$
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
1978
Reference
https://www.sciencedirect.com/science/article/pii/0097849378900213