Cyrus–Beck (Convex Polygonal Window; Convex Polyhedral window Line Clipping)

From Algorithm Wiki

Revision as of 10:33, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(np)$ == 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 == 1978 == Reference == https://www.sciencedirect.com/science/article/pii/0097849378900213")

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

Jump to navigation Jump to search

Time Complexity

$O(np)$

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

1978

Reference

https://www.sciencedirect.com/science/article/pii/0097849378900213

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Cyrus–Beck_(Convex_Polygonal_Window;_Convex_Polyhedral_window_Line_Clipping)&oldid=44450"