O(lg N) algorithm (convex polygonal window Line Clipping)

From Algorithm Wiki

Revision as of 10:38, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n*logp)$ == 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 == 1994 == Reference == https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0097849394900647/pdf?md5=06bd1f11031af17d1fd34626c4e2f49b&pid=1-s2.0-0097849394900647-main.pdf")

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

Jump to navigation Jump to search

Time Complexity

$O(n*logp)$

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

1994

Reference

https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0097849394900647/pdf?md5=06bd1f11031af17d1fd34626c4e2f49b&pid=1-s2.0-0097849394900647-main.pdf

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=O(lg_N)_algorithm_(convex_polygonal_window_Line_Clipping)&oldid=44653"