Mesh partitioning into Convex Parts #8780
|
Does CGAL have any method to partition a concave mesh into convex parts? This is just an image from google search to illustrate what I mean: |
Replies: 1 comment 2 replies
|
Do you need an exact decomposition or an approximate one? There is this package that does the exact one: There is also an implementation of an approximate decomposition that was started here but that has some implementation issues as it is way too slow compared to the author's implementation. Unfortunately we did not have time to fix it yet. |
|
Thank you i will try exact convex decomposition, most of the cases I have are quite simple. |
|
The approximate version is now part of "main" branch: https://doc.cgal.org/6.2/Convex_decomposition_3/index.html#title4 Example: Convex_decomposition_3/approximate_convex_decomposition.cpp |
Do you need an exact decomposition or an approximate one?
There is this package that does the exact one:
https://doc.cgal.org/latest/Convex_decomposition_3/index.html
but it is not as robust as we would like (plus probably too slow).
There is also an implementation of an approximate decomposition that was started here but that has some implementation issues as it is way too slow compared to the author's implementation. Unfortunately we did not have time to fix it yet.