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.

[samsibbens]

I was getting really discouraged but then you said "let's put this into code and see if that makes more sense" and then I was like "Yeah!!!! It'll be written in my language, code!" I learned verlet integration and inverse kinematics from you. I'll always be thankful for your videos

[onkelhoy]

Wow coming back to this after all these years, i dont know why you suddenly dissapeared but i hope everything is okay, thank you for your amazing content!

[jvhgcc]

Great video, this really helped me out after many other 'answers' I found online just confused me... thanks man, a line segment intersection algorithm is the last collision algorithm I need for my game, now I feel like I'm 3/4 of the way there!

[victorquebec]

One of the best explanations on the topic, if not the best one: mathematical background followed by coding praxis. Thank you!

[harilalmn]

Excellent explanation... !! I was finding it tough to understand in many other explanations on internet, but the concept became super clear now. Thanks a ton!!

[jontis]

If only going to programing class gave me the same feeling as seeing one of your videos in my sub box..

Would love to see some more videos on 2D hit detection in the future btw, preferably on some more complex shapes.

[abdlwahdsa]

my high school math finally came in handy :D.
I appreciate math now

[naraksama]

Finally. 8th grade mathematics starts to be useful!

[Zilarrezko]

I've entered the fun part of youtube.

[Skyltn]

You my friend are a legend in teaching. 👍

[smv]

7:46 This literally clicked open some switch in my brain and now I know how to do line segment collision detection all of a sudden. Thanks!

[jenyasidyakin]

Thank you, that was a great explanation

[felipeconter]

thank you so much, this understanding helped me on programming my master's research code!

[Polaroidon]

Looking forward to the next part a whole lot! Love these videos so much.

[hndr]

Thanks Sir, this video help me a lot ! Very clear explanation ! Love it !

[ginzburgi.]

Why does it say C= Ax1 + By1 at 5:53? Isn't it supposed to be C=Ax+By? Please clarify, thanks

[clcovenanas]

So perfect these videos, they're so useful! I love you!

[Hellfuryfire]

Hi. I am new to your channel and I am very interested in programming topics, although my knowledge in the area is almost nil. I would like to know what programming language you use and what I must do to execute your code lines once you have the language. Forgive my English, but it is not my native language. Thanks and I hope not to be too rude when I ask for your help.

[DeadalusX]

i don't understand why in the algorithm you write a=y2-y1 but for b its b=x1-x2 ?

[seancodes]

Hi! This helped me a bunch! I was wondering it seems like there is a few of ways to solve/find a line intersection. Slope intercept, Standard Form, and Parametric. I think slope intercept is very limited and that is why we do not use it. Is there any advantage over B1x + A2y = B2x + A2y versus Point1 + Direction1*T1 = P3 + Direction2*T2! I seem to see both ways used around the web and I am having a hard time deciding which one we are supposed to use and why