Minimum Near-Convex Shape Decomposition

@article{Ren2013MinimumNS,
  title={Minimum Near-Convex Shape Decomposition},
  author={Zhou Ren and Junsong Yuan and Wenyu Liu},
  journal={IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year={2013},
  volume={35},
  pages={2546-2552}
}
Shape decomposition is a fundamental problem for part-based shape representation. We propose the minimum near-convex decomposition (MNCD) to decompose arbitrary shapes into minimum number of "near-convex" parts. The near-convex shape decomposition is formulated as a discrete optimization problem by minimizing the number of nonintersecting cuts. Two perception rules are imposed as constraints into our objective function to improve the visual naturalness of the decomposition. With the degree of… CONTINUE READING
Highly Cited
This paper has 24 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Minimum Convex Decomposition, www.cs.ubc.ca/ ~snoeyink/demos/convdecomp

  • J. M. Keil, J. Snoeyink
  • 2007
Highly Influential
3 Excerpts