Polygon Clipping with Convex Clipping Polygon: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
 
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]]
== Space Complexity Graph ==
[[File:Polygon Clipping - Polygon Clipping with Convex Clipping Polygon - Space.png|1000px]]
== Time-Space Tradeoff ==
[[File:Polygon Clipping - Polygon Clipping with Convex Clipping Polygon - Pareto Frontier.png|1000px]]

Latest revision as of 10: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

Polygon Clipping - Polygon Clipping with Convex Clipping Polygon - Time.png