Coding Math: Episode 32 - Line Intersections Part I
Also known as alphabet soup. Lots of algebra going on here, but the idea is to derive a function that will detect when two lines intersect. There's a lot more here than you need to know if you just want to copy and paste a function. But assuming you want to learn how that function works, watch this video a few times until all those letters I'm shouting out start to make sense. It took me a while. Support Coding Math: / codingmath Source Code: http://github.com/bit101/codingmath

▶︎
Coding Math: Episode 33 - Line Intersections Part II

▶︎
Calculating Ray-Sphere Intersections

▶︎
3D line intersections

▶︎
When Math Isn’t Based in Reality

▶︎
Sweep-Line Algorithm for Line Segment Intersection (2/5) | Computational Geometry - Lecture 02

▶︎
How To Collide 2D Polygons With Flat Surfaces And Sloped Lines

▶︎
Line Segment Intersection

▶︎
Convex Polygon Collisions #1

▶︎
Man with suspended licence joins court call while driving

▶︎
Who is Smarter? Engineer vs Chinese 5th Grader

▶︎
The FULL VIDEO of Trump they didn’t want released

▶︎
This Paradox Splits Smart People 50/50

▶︎
Extreme SIMD: Optimized Collision Detection in Titanfall

▶︎
Coding Math: Episode 20 - More on Bezier Curves

▶︎
Raycasting in 2D (line segment intersection)

▶︎
You Know This Song (but the Orchestra Doesn’t) | Jacob Collier & VSO School of Music Orchestra | TED

▶︎
Coding Math: Episode 34 - Line Intersections Part III

▶︎
JANITOR vs THE BIGGEST GUYS IN THE GYM. They Didn’t Expect THAT

▶︎
