Rectangular Window: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 32: | Line 32: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:Line Clipping - Rectangular Window - Time.png|1000px]] | [[File:Line Clipping - Rectangular Window - Time.png|1000px]] | ||
== Space Complexity | == Space Complexity Graph == | ||
[[File:Line Clipping - Rectangular Window - Space.png|1000px]] | [[File:Line Clipping - Rectangular Window - Space.png|1000px]] | ||
== Pareto | == Pareto Frontier Improvements Graph == | ||
[[File:Line Clipping - Rectangular Window - Pareto Frontier.png|1000px]] | [[File:Line Clipping - Rectangular Window - Pareto Frontier.png|1000px]] | ||
Revision as of 14:04, 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 Frontier Improvements Graph
References/Citation
https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/357332.357333