Nordbeck and Rystedt (Grid Method) (Point-in-Polygon Point-in-Polygon): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(a)$ == Space Complexity == $O({1})$ words (Only need to keep track of the current grid square being checked (assuming the set of squares is given in the input)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1967 == Reference == https://doi.org/10.1007/BF01934125") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(n)$ | ||
== Space Complexity == | == Space Complexity == | ||
$O( | $O(n)$ words | ||
( | (https://ir.nctu.edu.tw/bitstream/11536/749/1/A1997WM15100010.pdf) | ||
== Description == | == Description == | ||
Latest revision as of 09:50, 10 April 2023
Time Complexity
$O(n)$
Space Complexity
$O(n)$ words
(https://ir.nctu.edu.tw/bitstream/11536/749/1/A1997WM15100010.pdf)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Real RAM
Year
1967