| .. | ||
| cmake_modules | ||
| examples | ||
| libnest2d | ||
| tests | ||
| tools | ||
| CMakeLists.txt | ||
| libnest2d.h | ||
| LICENSE.txt | ||
| README.md | ||
Introduction
Libnest2D is a library and framework for the 2D bin packaging problem.
Inspired from the SVGNest Javascript library the project is
built from scratch in C++11. The library is written with a policy that it should
be usable out of the box with a very simple interface but has to be customizable
to the very core as well. The algorithms are defined in a header only fashion
with templated geometry types. These geometries can have custom or already
existing implementation to avoid copying or having unnecessary dependencies.
A default backend is provided if the user of the library just wants to use it out of the box without additional integration. The default backend is reasonably fast and robust, being built on top of boost geometry and the polyclipping library. Usage of this default backend implies the dependency on these packages as well as the compilation of the backend itself (The default backend is not yet header only).
This software is currently under construction and lacks a throughout documentation and some essential algorithms as well. At this stage it works well for rectangles and convex closed polygons without considering holes and concavities.
Holes and non-convex polygons will be usable in the near future as well.
References
- SVGNest
- An effective heuristic for the two-dimensional irregular bin packing problem
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- Applying Meta-Heuristic Algorithms to the Nesting Problem Utilising the No Fit Polygon
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums