Liang–Barsky (Rectangular Window Line Clipping)

From Algorithm Wiki

Revision as of 07:54, 10 April 2023 by Admin (talk | contribs)

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

Jump to navigation Jump to search

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

1984

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/357332.357333

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