Convex Polygonal Window: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:Convex Polygonal Window (Line Clipping)}} == Description == Line clipping is the process of removing lines or portions of lines outside an area of interest. Typically; any line or part thereof which is outside of the viewing area is removed. Here, the viewing area is a convex polygon. == Related Problems == Generalizations: Convex Polyhedral Window Subproblem: Rectangular Window == Parameters == <pre>n: number of lines p: number of edges o...") |
No edit summary |
||
| Line 12: | Line 12: | ||
== Parameters == | == Parameters == | ||
n: number of lines | |||
p: number of edges on polygon | |||
p: number of edges on polygon | |||
== Table of Algorithms == | == Table of Algorithms == | ||
Revision as of 12:02, 15 February 2023
Description
Line clipping is the process of removing lines or portions of lines outside an area of interest. Typically; any line or part thereof which is outside of the viewing area is removed. Here, the viewing area is a convex polygon.
Related Problems
Generalizations: Convex Polyhedral Window
Subproblem: Rectangular Window
Parameters
n: number of lines
p: number of edges on polygon
Table of Algorithms
Currently no algorithms in our database for the given problem.
Time Complexity graph
Space Complexity graph
Pareto Decades graph
