Polygon Clipping with Arbitrary Clipping Polygon: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "{{DISPLAYTITLE:Polygon Clipping with Arbitrary Clipping Polygon (Polygon Clipping)}} == Description == Clipping is an essential part of image synthesis. Traditionally, polygon clipping has been used to clip out the portions of a polygon that lie outside the window of the output device to prevent undesirable effects. In the recent past polygon clipping is used to render 3D images through hidden surface removal and to produce high-quality surface details using techniques...")
 
No edit summary
Line 28: Line 28:
|}
|}


== Time Complexity graph ==  
== Time Complexity Graph ==  


[[File:Polygon Clipping - Polygon Clipping with Arbitrary Clipping Polygon - Time.png|1000px]]
[[File:Polygon Clipping - Polygon Clipping with Arbitrary Clipping Polygon - Time.png|1000px]]


== Space Complexity graph ==  
== Space Complexity Graph ==  


[[File:Polygon Clipping - Polygon Clipping with Arbitrary Clipping Polygon - Space.png|1000px]]
[[File:Polygon Clipping - Polygon Clipping with Arbitrary Clipping Polygon - Space.png|1000px]]


== Pareto Decades graph ==  
== Pareto Frontier Improvements Graph ==  


[[File:Polygon Clipping - Polygon Clipping with Arbitrary Clipping Polygon - Pareto Frontier.png|1000px]]
[[File:Polygon Clipping - Polygon Clipping with Arbitrary Clipping Polygon - Pareto Frontier.png|1000px]]

Revision as of 13:04, 15 February 2023

Description

Clipping is an essential part of image synthesis. Traditionally, polygon clipping has been used to clip out the portions of a polygon that lie outside the window of the output device to prevent undesirable effects. In the recent past polygon clipping is used to render 3D images through hidden surface removal and to produce high-quality surface details using techniques such as Beam tracing. Polygon clipping is also used in distributing the objects of a scene to appropriate processors in multiprocessor raytracing systems to improve rendering speeds.

Related Problems

Subproblem: Polygon Clipping with Convex Clipping Polygon

Parameters

No parameters found.

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
Greiner–Hormann clipping algorithm 1998 $O(n^{2})$ ? $O(n^{2})$ auxiliary? Exact Deterministic Time
Vatti clipping algorithm 1992 $O(n^{2})$ ? $O(n^{2})$ auxiliary? Exact Deterministic Time
Weiler–Atherton clipping algorithm 1977 $O(n^{2})$ $O(n^{2})$ 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 Frontier Improvements Graph

Error creating thumbnail: Unable to save thumbnail to destination