Salomon (Swath Method) (Point-in-Polygon Point-in-Polygon)

From Algorithm Wiki
Revision as of 11:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(n^{2})$ words (https://ir.nctu.edu.tw/bitstream/11536/749/1/A1997WM15100010.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1978 == Reference == https://doi.org/10.1016/0098-3004(78)90085-7")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(nlogn)$

Space Complexity

$O(n^{2})$ words

(https://ir.nctu.edu.tw/bitstream/11536/749/1/A1997WM15100010.pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1978

Reference

https://doi.org/10.1016/0098-3004(78)90085-7

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Salomon_(Swath_Method)_(Point-in-Polygon_Point-in-Polygon)&oldid=44988"