Convex Polygonal Window: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 36: | Line 36: | ||
[[File:Line Clipping - Convex Polygonal Window - Space.png|1000px]] | [[File:Line Clipping - Convex Polygonal Window - Space.png|1000px]] | ||
== | == Space-Time Tradeoff Improvements == | ||
[[File:Line Clipping - Convex Polygonal Window - Pareto Frontier.png|1000px]] | [[File:Line Clipping - Convex Polygonal Window - Pareto Frontier.png|1000px]] | ||
Revision as of 14:35, 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
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Cyrus–Beck | 1978 | $O(np)$ | $O({1})$ auxiliary? | Exact | Deterministic | Time |
Time Complexity Graph
Space Complexity Graph
Space-Time Tradeoff Improvements
