Polygon Clipping with Convex Clipping Polygon (Polygon Clipping)

From Algorithm Wiki
Revision as of 10:21, 15 February 2023 by Admin (talk | contribs) (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...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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

Error creating thumbnail: Unable to save thumbnail to destination

Space Complexity graph

Error creating thumbnail: Unable to save thumbnail to destination

Pareto Decades graph

Error creating thumbnail: Unable to save thumbnail to destination