Convex Polygonal Window: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 12: | Line 12: | ||
== Parameters == | == Parameters == | ||
n: number of lines | $n$: number of lines | ||
p: number of edges on polygon | $p$: number of edges on polygon | ||
== Table of Algorithms == | == Table of Algorithms == | ||
| Line 24: | Line 24: | ||
|- | |- | ||
| [[Cyrus–Beck (Convex Polygonal Window; Convex Polyhedral window Line Clipping)|Cyrus–Beck]] || 1978 || $O(np)$ || $O({1})$ | | [[Cyrus–Beck (Convex Polygonal Window; Convex Polyhedral window Line Clipping)|Cyrus–Beck]] || 1978 || $O(np)$ || $O({1})$ || Exact || Deterministic || [https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0097849378900213 Time] | ||
|- | |- | ||
|} | |} | ||
Revision as of 07:52, 10 April 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})$ | 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
Time-Space Tradeoff
Error creating thumbnail: Unable to save thumbnail to destination