Does this naive image packing algorithm I came up with has a name?

Here’s the context, I have a couple of 3D models that each have a couple of textures, for technical and practical reasons I have to use the least amount of textures for them, i.e. pack them into an atlas.

After failing to do it, I tried again with the most naive approach I could came up with and it worked suprisingly well!

I was wondering if that piece of code is actually a well-known algorithm or not.

Here’s the code with comments:

// this is inside a loop that iterates all of the models
if (images.Any()) // just a guard to not add an empty container
{
    if (containers.Any(s => images.All(s.Contains)))
    {
        // these are already in some containers (different models use same textures in fact)
    }
    else
    {
        // try find the first container that has enough room
        var container = containers.FirstOrDefault(s => s.Count + textures.Length <= max);

        if (container != null) // add them to it
        {
            container.AddRange(images);
        }
        else // create a new container for these images
        {
            containers.Add(new List<Texture2D>(images));
        }
    }
}

Basically, it’s like dropping grains of sands that forms a pyramid, the lower level forming the base of the pyramid being the first container (I guess you’ve all seen this once).

The above code, yet so simple, exceed my expectations, from 441 images I ended up to 150 (no dupes) in only 7 bins:

enter image description here

(also, my requirements were rather simple, pack power of two sized squares into larger power of two squares)

Question:

Does the above piece of code is a well-known algorithm or not?