Polyhedron.cpp // TODO: Do 2D convex hull. about mathgeolib HOT 2 CLOSED

Thanks for querying. This was a long time todo, and did not have much interest in implementing handling for that case. Pushed in an implementation for this now in the above commit, and added a test for the planar case. I have not visualized this kind of scenario extensively in practice, so not sure how numerically float robust the implementation is - there may be some corner cases.

Basically the implementation detects if the input point set is planar so that either 3D convex hull computation fails, or the OBB computation fails, and then the common plane of the whole input point set is detected, and the point set projected flat to that common 2D plane, and a resulting OBB is constructed in that orientation. If you have point sets for which the computation fails badly, try building a test case with the tricky point set included (see the above commit for an example).

from mathgeolib.

Thank you!

Should I find a case where it's not behaving as expected, I will open an issue about it.

Best Regards

from mathgeolib.