Rectangular 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 | ||
== Table of Algorithms == | == Table of Algorithms == | ||
| Line 22: | Line 22: | ||
|- | |- | ||
| [[Cohen–Sutherland (Rectangular Window Line Clipping)|Cohen–Sutherland]] || 1967 || $O(n)$ || $O({1})$ | | [[Cohen–Sutherland (Rectangular Window Line Clipping)|Cohen–Sutherland]] || 1967 || $O(n)$ || $O({1})$ || Exact || Deterministic || [https://books.google.com/books/about/Principles_of_interactive_computer_graph.html?id=inJ8AAAAIAAJ Time] | ||
|- | |- | ||
| [[Liang–Barsky (Rectangular Window Line Clipping)|Liang–Barsky]] || 1984 || $O(n)$ || $O({1})$ | | [[Liang–Barsky (Rectangular Window Line Clipping)|Liang–Barsky]] || 1984 || $O(n)$ || $O({1})$ || Exact || Deterministic || [https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/357332.357333 Time] | ||
|- | |- | ||
| [[Nicholl–Lee–Nicholl (Rectangular Window Line Clipping)|Nicholl–Lee–Nicholl]] || 1987 || $O(n)$ || $O({1})$ | | [[Nicholl–Lee–Nicholl (Rectangular Window Line Clipping)|Nicholl–Lee–Nicholl]] || 1987 || $O(n)$ || $O({1})$ || Exact || Deterministic || [https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/37401.37432 Time] | ||
|- | |- | ||
| [[Fast clipping (Rectangular Window Line Clipping)|Fast clipping]] || 1987 || $O(n)$ || $O({1})$ | | [[Fast clipping (Rectangular Window Line Clipping)|Fast clipping]] || 1987 || $O(n)$ || $O({1})$ || Exact || Deterministic || [https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0097849387900616 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 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})$ | Exact | Deterministic | Time |
| Liang–Barsky | 1984 | $O(n)$ | $O({1})$ | Exact | Deterministic | Time |
| Nicholl–Lee–Nicholl | 1987 | $O(n)$ | $O({1})$ | Exact | Deterministic | Time |
| Fast clipping | 1987 | $O(n)$ | $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
References/Citation
https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/357332.357333