BCAM - Lantek PhD Position in 2D and 3D packing with curved geometries
The goal of this project is to develop a unified computational framework for 2D and 3D nesting of polygonal and curved (free-form, NURBS) objects. The proposed project consists of 4 stages.
1. Implement state-of-the-art algorithms for polygonal 2D nesting (D function, Phi-function, Non-fitting polygon). The algorithms will be implemented using a publicly free software, e.g. CGAL (https://www.cgal.org) or Irit (http://www.cs.technion.ac.il/~irit/).
2. The C/C++ code will be exported to the commercial software Expert (Lantek) and tested against the state-of-the-art algorithms. Path-planning algorithms to minimize the cutting time will also be investigated. Physical validations of the algorithm will be realized in Lantek.
3. 2D generalization towards curved objects and boundaries. Boundary representation (B-spline, NURBS) will be used and smooth shape descriptors (curvature) will be applied to design algorithm for highly accurate local matching.
4. Generalization to 3D. Sphere packing problem with curved boundaries.