Polygon Clipping with Convex Clipping Polygon: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:Polygon Clipping with Convex Clipping Polygon (Polygon Clipping)}} == 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 == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference...") |
No edit summary |
||
| Line 24: | Line 24: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:Polygon Clipping - Polygon Clipping with Convex Clipping Polygon - Time.png|1000px]] | [[File:Polygon Clipping - Polygon Clipping with Convex Clipping Polygon - Time.png|1000px]] | ||
== Space Complexity | == Space Complexity Graph == | ||
[[File:Polygon Clipping - Polygon Clipping with Convex Clipping Polygon - Space.png|1000px]] | [[File:Polygon Clipping - Polygon Clipping with Convex Clipping Polygon - Space.png|1000px]] | ||
== Pareto | == Pareto Frontier Improvements Graph == | ||
[[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 14:04, 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
Pareto Frontier Improvements Graph
