Convex Shape Decomposition

In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming problem, and obtain approximate optimal solution by minimizing the total cost of decomposition under some concavity constraints, using linear programming method. Our method is based on Morse theory and combines information from multiple Morse functions. The obtained decomposition provides a compact representation, both geometrical and topological, of original object. Our experiments show that such representation is very useful in many applications.

• Type: Conference
• Year: 2010
• Where: CVPR
• Authors: Liu Hairong, Longin Jan Latecki, Liu Wenyu
• Keywords: Computer Vision, CVPR 2010, Decomposition, Shape Decomposition, Shape Decomposition Method