Generalize to arbitrary shapes
Closed this issue · 1 comments
Stuff you probably already know
Algorithms that pack arbitrary shapes are useful for a variety of applications. For example, a manufacturer can pack parts to be cut from a sheet of material so as to minimize the amount of material wasted. In the most general setting the problem has no known solution. Particular cases, like the one this crate solves, can be shown to be NP-complete. But as with many NP-complete problems, there are approximating algorithms that do pretty well in practice.
Arbitrary shapes
It would be nice to have a crate that can pack arbitrary shapes. Such a crate, if it were generic, would have many potential uses.
a cool idea! out of scope for this library specifically, and not something i know how to write, but if someone makes a crate that does this i’d be super interested in their implementation