This is a Minimum Viable Product (MVP) to solve the classic problem of 2D irregular packing with concave polygon. It uses No-Fit Polygon (NFP) algorithms combined with the Bottom-Left Fill heuristic to optimize space utilization efficiently.
-
Notifications
You must be signed in to change notification settings - Fork 0
yuanhaoMin/2d-irregular-packing
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published