I’m applying for a master of computer science degree and I’m researching optimization problems. My object of study is three-dimensional packing of irregular pieces (polyhedra in this case) and one of the difficulties I’m facing is dealing with polygonal overlapping and for that, I need to calculate the intersection between two pieces.
I came across your library through PyMesh, a python-based library for geometric processing of meshes and one of the engines it uses is CGAL in fact, CGAL was the best engine that solved my problem.
Considering the fact of the library be really extensive and I barely know C/C++, I was wondering which algorithm the CGAL uses to calculate intersection and what is its complexity. If it is possible, I would like the pseudocode.