Point in convex polygon - fast O(qlogn) algorithm

In this video you will learn about fast algorithm of checking whether point is inside or outside of the convex polygon. With this algorithm answer for each query can be efficiently found using just log(n) operations.
Source code of the algorithm: github.com/Mat...
-------
Music: «New dawn» from Bensound.com

[@emilharutyunyan7301]

Had hard time understanding it in Computer Graphics class, thank you. It was very helpful

[@falseee4445]

finally a good video on this ! thanks !!

[@simamr8087]

i love maths clever things . great content keep up!

[@cristian199783]

Thanks, nice explanation !

[@shahedannam1697]

awesome

[@atikurrahmanhridoy7192]

Helpful

[@hackerhaddi]

good video

[@herooo.2928]

This doesn't look like log n. It's a linear scan of the vertices until you find two vectors which point Q lies in.

[@YoO161]

yea thats what the visualisation shows, but as we have a binary choice (positive or negative) it can be done with binary search

[@107-t9s]

przepraszam

[@107-t9s]

przepraszam

[@또루꾸막뚜]

fucking good