Point in convex polygon - fast O(qlogn) algorithm

preview_player
Показать описание
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.


-------
Рекомендации по теме
Комментарии
Автор

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

emilharutyunyan
Автор

i love maths clever things . great content keep up!

simamr
Автор

finally a good video on this ! thanks !!

falseee
Автор

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.

herooo.