Nordbeck and Rystedt (Orientation) (Point-in-Polygon Point-in-Polygon)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O({1})$ words

(Only need to keep track of current side being looked at)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1967

Reference

https://doi-org.ezproxy.canberra.edu.au/10.1007/BF01934125