Polygon Clipping with Convex Clipping Polygon: Difference between revisions

Revision as of 07:52, 10 April 2023

Here, the clipping polygon is restricted to being convex.

No parameters found.

Name	Year	Time	Space	Approximation Factor	Model	Reference
Sutherland–Hodgman algorithm	1974	$O(n^{2})$	$O(n)$	Exact	Deterministic	Time

@@ Line 20: / Line 20: @@
 |-
-| [[Sutherland–Hodgman algorithm (Polygon Clipping with Convex Clipping Polygon Polygon Clipping)|Sutherland–Hodgman algorithm]] || 1974 || $O(n^{2})$ || $O(n)$ auxiliary || Exact || Deterministic || [https://dl.acm.org/doi/10.1145/360767.360802 Time]
+| [[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]
 |-
 |}