2d
Batman (NES) Pixel Art Study
I’m trying to improve my pixel art skill, so I thought it would be fun to look closely at one of the best looking games on the NES – Batman!
Hopefully I can learn a few things from these great artists.
Grab a snack and enjoy some art with me 😀.
FABRIK Algorithm (2D)
The FABRIK algorithm is an amazingly clever solution to the Inverse Kinematics problem – how to adjust the joints of an arm to reach a target location.
In this tutorial, I go over how the core algorithm works in 2D, building up from simple concepts.
Polygon Clipping (Part 2)
My previous polygon clipping tutorial dove into the Greiner-Hormann clipping algorithm. Unfortunately, this algorithm fails at common cases… so let’s revist the problem and try again.
The F. Martinez 2008 algorithm handles coincident edges (unlike Greiner-Hormann), but it still has some minor goofiness. Let’s solve this problem once and for all.
Polygon Clipping (Part 1)
Polygon clipping is an interesting problem: how do you intersect, union, or diff two polygons?
My first attempt was a failure:
Polygon Clipping - Part 1 (Greiner-Hormann)
So I researched and developed another algorithm, which handles every case:
Polygon Clipping - Part 2 (Modified F. Martinez 2008)
Two-Dimensional Bin Packing
Given a collection of different sized images, how can you efficiently pack them into one big image?
Brute-forcing the problem is too expensive - so here we come up with a simple heuristic that works pretty well.