Polygon Clipping with Convex Clipping Polygon: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 20: | Line 20: | ||
|- | |- | ||
| [[Sutherland–Hodgman algorithm (Polygon Clipping with Convex Clipping Polygon Polygon Clipping)|Sutherland–Hodgman algorithm]] || 1974 || $O(n^{2})$ || $O(n)$ | | [[Sutherland–Hodgman algorithm (Polygon Clipping with Convex Clipping Polygon Polygon Clipping)|Sutherland–Hodgman algorithm]] || 1974 || $O(n^{2})$ || $O(n)$ || Exact || Deterministic || [https://dl.acm.org/doi/10.1145/360767.360802 Time] | ||
|- | |- | ||
|} | |} | ||
| Line 27: | Line 27: | ||
[[File:Polygon Clipping - Polygon Clipping with Convex Clipping Polygon - Time.png|1000px]] | [[File:Polygon Clipping - Polygon Clipping with Convex Clipping Polygon - Time.png|1000px]] | ||
Latest revision as of 09:08, 28 April 2023
Description
Here, the clipping polygon is restricted to being convex.
Related Problems
Generalizations: Polygon Clipping with Arbitrary Clipping Polygon
Parameters
No parameters found.
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Sutherland–Hodgman algorithm | 1974 | $O(n^{2})$ | $O(n)$ | Exact | Deterministic | Time |
Time Complexity Graph
