“Variational, meaningful shape decomposition” by Krayevoy and Sheffer
Conference:
Type(s):
Title:
- Variational, meaningful shape decomposition
Session/Category Title: Shaping Up
Presenter(s)/Author(s):
Abstract:
An algorithm for variational, meaningful shape decomposition based on a novel convexity metric. The algorithm doesn’t require model-specific fine-tuning and operates on models with arbitrary genus.
References:
1. Cohen-Steiner, D., Alliez, P., and Desbrun, M. 2004. Variational shape approximation. ACM Trans. Graph. 23, 3, 905–914.
2. Katz, S., Leifman, G., and Tal, A. 2005. Mesh segmentation using feature point and core extraction. In Proceedings of Pacific Graphics, vol. 21, 649–658.
3. Lien, J.-M., and Amato, N. M. 2006. Approximate convex decomposition of polyhedra. Tech. Rep. TR06–002, Texas A&M University.
ACM Digital Library Publication:
Overview Page:
Submit a story:
If you would like to submit a story about this presentation, please contact us: historyarchives@siggraph.org
