- 1
- 11 543
MathEsthesia
เข้าร่วมเมื่อ 1 ก.ย. 2019
Elegance and harmony of math in visual representations of concepts
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/MathEsthesia/Point-in-convex-polygon
-------
Music: «New dawn» from Bensound.com
Source code of the algorithm: github.com/MathEsthesia/Point-in-convex-polygon
-------
Music: «New dawn» from Bensound.com
มุมมอง: 11 543
awesome
Helpful
Had hard time understanding it in Computer Graphics class, thank you. It was very helpful <3
i love maths clever things . great content keep up!
przepraszam
Thanks, nice explanation !
fucking good
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.
yea thats what the visualisation shows, but as we have a binary choice (positive or negative) it can be done with binary search
przepraszam
finally a good video on this ! thanks !!
good video