Approximate Convex Decomposition
One common strategy for dealing with large, complex models is to partition them into pieces that are easier to handle. Many problems can be solved more efficiently when the input is convex. While decomposition into convex components results in pieces that are easy to process, such decompositions can be costly to construct and often result in representations with an unmanageable number of components. We propose an alternative partitioning strategy that decomposes a given model (in 2D or 3D) into "approximately convex" pieces.
Approximate Convex Decomposition Publications

Skeletonization
Shape decomposition and skeletonization share many common properties and applications. However, they are generally considered as independent methods. In this paper, we propose a framework that simultaneously generates both shape decomposition and skeletons by considering that both processes and the qualities of their results are interdependent.
Skeletonization Publications