decomposition of model to convex parts
Author
Does anyone know of a procedural way of decomposing a mesh into the smallest possible number of purely-convex components? Let's assume the mesh is a smooth, continuous surface.
Decomposition is a very hard problem, one that is usually better solved by introducing new vertices/edges into the mesh. Getting the minimum number is even harder. In 2D, the problem of decomposing a polygon into a minimum number of convex polygons itself is complicated. Do a Google search on "3D convex decomposition" to get an idea of what folks have tried.
Check out John Ratcliff's page at http://codesuppository.blogspot.com/, as it has convex decomposition code available.
This topic is closed to new replies.
Advertisement
Popular Topics
Advertisement
