Nicholl–Lee–Nicholl (Rectangular Window Line Clipping)

From Algorithm Wiki

Revision as of 10:33, 15 February 2023 by Admin (talk | contribs) (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")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Nicholl–Lee–Nicholl_(Rectangular_Window_Line_Clipping)&oldid=44451"