Packing algorithm node

Packing algorithms are tricky! But we should find or build one that's high quality and efficient based on whatever the state of the art is in this field of research that supports nonconvex shapes, and even shapes within shapes.

The motivating use case is creating a sign like this out of icons:


No files, tests, or entry points are named. Start by researching packing algorithms that support nonconvex and nested shapes, then clarify whether the goal is to select an existing approach or build one for the icon-based sign use case. Done requires an agreed algorithm and a defined node implementation or integration scope.

Scritto dal modello di indicizzazione a partire dal testo della issue.