Nicholl–Lee–Nicholl (Rectangular Window Line Clipping): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ auxiliary words (Easily derived (O(1) per segment, space can be re-used)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1987 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/37401.37432") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O({1})$ | $O({1})$ words | ||
(Easily derived (O(1) per segment, space can be re-used)) | (Easily derived (O(1) per segment, space can be re-used)) | ||
Latest revision as of 07:54, 10 April 2023
Time Complexity
$O(n)$
Space Complexity
$O({1})$ words
(Easily derived (O(1) per segment, space can be re-used))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1987
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/37401.37432