Nordbeck and Rystedt (Sum of area) (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(n)$ == Space Complexity == $O({1})$ words (Only need to keep track of current triangle and total area sum) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1967 == Reference == https://doi.org/10.1007/BF01934125")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O({1})$ words

(Only need to keep track of current triangle and total area sum)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1967

Reference

https://doi.org/10.1007/BF01934125

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