Rectangular Window: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:Rectangular 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 rectangular. == Related Problems == Generalizations: Convex Polygonal Window Related: Convex Polyhedral Window == Parameters == <pre>n: number of lines</pre> == Table of Algorithm...") |
No edit summary |
||
| Line 12: | Line 12: | ||
== Parameters == | == Parameters == | ||
n: number of lines | |||
== 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 rectangular.
Related Problems
Generalizations: Convex Polygonal Window
Related: Convex Polyhedral Window
Parameters
n: number of lines
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Cohen–Sutherland | 1967 | $O(n)$ | $O({1})$ auxiliary | Exact | Deterministic | Time |
| Liang–Barsky | 1984 | $O(n)$ | $O({1})$ auxiliary | Exact | Deterministic | Time |
| Nicholl–Lee–Nicholl | 1987 | $O(n)$ | $O({1})$ auxiliary | Exact | Deterministic | Time |
| Fast clipping | 1987 | $O(n)$ | $O({1})$ auxiliary | Exact | Deterministic | Time |
Time Complexity graph
Space Complexity graph
Pareto Decades graph
