Liang–Barsky (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 == 1984 == Reference == https://dl.acm.org/doi/10.1145/357332.357333")
(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

1984

Reference

https://dl.acm.org/doi/10.1145/357332.357333

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Liang–Barsky_(Rectangular_Window_Line_Clipping)&oldid=44449"