During my time working on game development, I have consumed content from various materials. Based on this experience, I would like to share some resources that I find beneficial to follow. Wide-ra...

The Graham scan algorithm compute the convex hull of a set of points in a plane. The convex hull is the smallest convex polygon that can enclose all the points in the set, much like stretching a ru...

Code snippets are small blocks of reusable code that perform a specific task in programming. Code snippets are valuable because they save time and effort, making it easier to understand or implemen...

GJK algorithm is a method used in computational geometry to determine if two convex shapes intersect. You can check the following sources to get information about the subject. Source 1 Source...