Skala (convex and non-convex polyhedral window Line Clipping)

From Algorithm Wiki
Revision as of 10:38, 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 == 1996 == Reference == https://onlinelibrary.wiley.com/doi/abs/10.1111/1467-8659.1510061")
(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

1996

Reference

https://onlinelibrary.wiley.com/doi/abs/10.1111/1467-8659.1510061

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Skala_(convex_and_non-convex_polyhedral_window_Line_Clipping)&oldid=44654"