Polygon Clipping with Convex Clipping Polygon: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 32: | Line 32: | ||
[[File:Polygon Clipping - Polygon Clipping with Convex Clipping Polygon - Space.png|1000px]] | [[File:Polygon Clipping - Polygon Clipping with Convex Clipping Polygon - Space.png|1000px]] | ||
== | == Space-Time Tradeoff Improvements == | ||
[[File:Polygon Clipping - Polygon Clipping with Convex Clipping Polygon - Pareto Frontier.png|1000px]] | [[File:Polygon Clipping - Polygon Clipping with Convex Clipping Polygon - Pareto Frontier.png|1000px]] | ||
Revision as of 15:36, 15 February 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)$ auxiliary | Exact | Deterministic | Time |
Time Complexity Graph
Space Complexity Graph
Space-Time Tradeoff Improvements
