- Видео 23
- Просмотров 10 242
Dumpster Cat
Добавлен 3 ноя 2017
I am a network engineer and electrical engineer from America. I also work in freelance pixel art. In my free time I study math, programming, and computer science. I use this channel to catalog projects I work on. :)
Separating Axis Theorem - Complete
Tutorial is coming at some point. Will optimize a few things.
Roadmap:
1. Full Desmos Lecture and Explanation
2. Programing Tutorial in GameMakerStudio 2
3. Programming Tutorial in Visual Studio
Roadmap:
1. Full Desmos Lecture and Explanation
2. Programing Tutorial in GameMakerStudio 2
3. Programming Tutorial in Visual Studio
Просмотров: 46
Видео
Line Circle Intersection - Circle Proof
Просмотров 54Месяц назад
Discovering how use use normals is like magic
Factorio - First railroad intersection using Train Signals
Просмотров 23Месяц назад
Test for an intersection i need in my regular game. Made in the sandbox. My goal is to avoid looking up solutions because i enjoy problem solving on my own. I dont know if this is the best way to do it but i think it works!
Separating Axis Theorem test in Desmos
Просмотров 107Месяц назад
Testing how to do the actual "collision" in Desmos. I did not do this for every axis, only one just to show that the logic works. Next step is to find the inner and outer projection along each axis, then find the axis of minimum penetration.
SAT Test 3
Просмотров 402 месяца назад
It isnt optimized but it does work. Too many for loops right now, so I need to work on removing those.
SAT Test 2
Просмотров 292 месяца назад
Its buggy. Its seems to act weird when multiple objects are colliding. Im working to fix this but it sort of works!
Line Collision Version 2 (READ DESC)
Просмотров 689 месяцев назад
This is a new system, about 120 lines of code. There are other sections of the collision system which need to be created, like full objects, weight, precedence, optimization, etc.. When the full project is done i will release a tutorial/showcase. While this isnt rocket science, its also not exactly a "knock-it-out-in-a-weekend" thing either... Please just bear with me :) Also more art content c...
Teutonic Knight Speedpixel
Просмотров 9610 месяцев назад
Hello. Today we are jamming to some game music and making a 8 character turn around for the Teutonic Knight from AoE 2. Hope you enjoy. ~92 minutes
The Dot Product and GMS2
Просмотров 8810 месяцев назад
Developing a new less resource intense collision system. The foundation of this system will be the intersecting lines theorem and the dot product. I will most likely abstract circle collisions to be some approximation of a circle using lines, as, currently at least, my circle collision system is resource intense. However as I learn more that may change also. :) Good day all. Thank you for viewing
Pixel Perfect Collision with Shapes
Просмотров 24511 месяцев назад
Shapes do not collide with other lines yet. adding that next :)
So Close... (annoying bug p2)
Просмотров 3111 месяцев назад
Not exactly what i want but its getting there.
Pixel Perfect Collision (incomplete)
Просмотров 8 тыс.11 месяцев назад
Needs to be refactored, but here is my take at pixel perfect collision (so far)
True Directional Movement but its Big Brain
Просмотров 36Год назад
True Directional Movement but its Big Brain
now in 3d
pls no
Awesome, really fun to look at. Whats the programming language ?
GMS2 is GML but is close to C++ and C#. This code barely uses any actual GML tho
The RUclips algorithm brought me here. Very cool, thank you Dumpster Cat
Thank you!
I actually cried here
LATEST UPDATE: ruclips.net/video/J07A9NPi914/видео.html
Isn't pixel perfect collision a thing in game engines? Barring 3D models
the game engine already has a way to do it, yes. This is more or less just for fun lol
@@dumpstercat2229 ah right I see, well have fun :)
Keep going 😎💪
Thanks for commenting!
SPOILERS: don't read if you want to figure this out by your own. If you solve this for arbitrary triangles, you can use this as a start to make meshes for your 2d pixel art. The advantage being that it is easier and cheap to detect line collisions (like you are doing, sort of). Notice that if two lines are not parallel, the only way they can collide is at the tips, so you can treat if they are parallel, the collision is relatively easy to compute too. Once you solve it for lines, build some kind of polygon engine and write a function to compute a polygon mesh which covers a pixel art closely. The tuple of pixel art and the polygon mesh together gives you the art and the collision mask
Thank you for the information and thank you for commenting! I will take all of the input I can. I know there are others who have been thinking about this a lot longer than I have 🙂
Thank you all for 1000 views. <3 The intention of this channel was only to catalog updates, and not create content. However, if you all have vested interest in the completion of this project I will consider making video explanations as well as continuing to update the channel. I am a full time college student (almost done) and network engineer. I also am a freelance pixel artist. I am very busy and cannot post a lot, but when I do post, look forward to seeing art or programming content.
this is pretty cool, yeah, thank you RUclips , very cool
Thank you for the kind words!
this is sick dude
Thank you!
Impressive!
Thank you!
Did you use SAT for this? awesome work!
I did not, I used the intersecting lines theorem. I dont know if it is as fast (probably not) but it does work, and its a bit easier to understand one you figure out how to parameterize a function (mainly lines) and work do matrix arithmetic.
that looks sick how much time did it take?
Many months of linear algebra study.
Wow
Thank you for commenting! :)
Nice
Thank you!
nice, happy hacking!
this is so cool, excited to see what else is to come. subscribed!
I appreciate your kind words. Thank you for commenting!
im confused? what is this showing?
It’s a collision system using the intersecting lines theorem. I had someone request that I upload it with no guides. I apologize for the lack of information, I will add some information to the description. Thank you :)
Circle vs line collision? What algorithm does it use?
It uses the intersecting lines theorem. I dont know if its fast or the best, but it works :)
There isnt actually any "collision" happening with the circle. There are lines being projected from the circles midpoint, then its just a matter of parameterizing the lines, then using those parameterizations to get their intersection point
nice
Thank you for commenting :)
@@dumpstercat2229 :) i try to leave comments on smaller videos
Me when i smell that yummy cheese
Big facts
Hell yeah bro!