Weiler–Atherton clipping algorithm (Polygon Clipping with Arbitrary Clipping Polygon Polygon Clipping)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2})$
Space Complexity
$O(n^{2})$? words
(Needs to keep track of (possibly) $O(n^2)$ intersection points)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1977
Reference
https://www.cs.drexel.edu/~david/Classes/CS430/HWs/p214-weiler.pdf