Polygon Clipping with Convex Clipping Polygon (Polygon Clipping)

From Algorithm Wiki
Revision as of 10:08, 28 April 2023 by Admin (talk | contribs)
(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)$ Exact Deterministic Time

Time Complexity Graph

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