Convex shape decomposition

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2010, Pages 97-104

  Liu, Hairong ^a   Liu, Wenyu ^a   Latecki, Longin Jan ^b  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b TEMPLE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE OPTIMAL SOLUTIONS; COMPACT REPRESENTATION; CONVEX DECOMPOSITION; CONVEX SHAPES; INTEGER LINEAR PROGRAMMING; MORSE FUNCTIONS; MORSE THE-ORY; SHAPE DECOMPOSITION; TOTAL COSTS;

COMPUTER VISION; INTEGER PROGRAMMING; TOPOLOGY;

OPTIMIZATION;

EID: 77956003740     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2010.5540225     Document Type: Conference Paper

References (19)

1. I. Biederman. Recognition-by-components: A theory of human image understanding. Psychological review, 94(2):115-147, 1987. 3
2. D. Cohen-Steiner, P. Alliez, and M. Desbrun. Variational shape approximation. In International Conference on Computer Graphics and Interactive Techniques, pages 905-914, 2004. 3
3. K. Cole-McLaughlin, H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci. Loops in Reeb graphs of 2-manifolds. Discrete and Computational Geometry, 32(2):231-244, 2004. 2
4. J. Erickson and S. Har-Peled. Optimally cutting a surface into a disk. Discrete and Computational Geometry, 31(1):37-59, 2004. 3
5. A. Fomenko and T. Kunii. Topological modeling for visualization. 1997. 3
6. D. Hoffman and M. Singh. Salience of visual parts. Cognition, 63(1):29-78, 1997. 3
7. S. Katz and A. Tal. Hierarchical mesh decomposition using fuzzy clustering and cuts. ACM Transactions on Graphics, 22(3):954-961, 2003. 3
8. L. Latecki and R. Lakamper. Convexity rule for shape decomposition based on discrete contour evolution. Computer Vision and Image Understanding, 73(3):441-454, 1999. 3
9. J. Latombe, P. Svestka, M. Overmars, L. Kavraki, and L. Kavraki. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. In IEEE International Conference on Robotics and Automation, 1994. 3
10. X. Li, T. Woon, T. Tan, and Z. Huang. Decomposing polygon meshes for interactive applications. In Proceedings of the 2001 symposium on Interactive 3D graphics, pages 35-42, 2001. 3
11. J. Lien and N. Amato. Approximate convex decomposition of polygons. Computational Geometry: Theory and Appli- cations, 35(1-2):100-123, 2006. 3, 7
12. J. Lien and N. Amato. Approximate convex decomposition of polyhedra. In ACM symposium on Solid and physical modeling, 2007. 3
13. X. Mi and D. DeCarlo. Separating parts from 2D shapes using relatability. In International Conference on Computer Vision, 2007. 6, 7
14. M. Mortara, G. Patane, M. Spagnuolo, B. Falcidieno, and J. Rossignac. Blowing bubbles for multi-scale analysis and decomposition of triangle meshes. Algorithmica, 38(1):227-248, 2003. 3
15. M. Mortara, G. Patane, M. Spagnuolo, B. Falcidieno, and J. Rossignac. Plumber: a method for a multi-scale decomposition of 3D shapes into tubular primitives and bodies. In ACM symposium on Solid modeling and applications, 2004. 3
16. A. Schrijver. Theory of linear and integer programming. John Wiley & Sons Inc, 1998. 2
17. K. Siddiqi and B. Kimia. Parts of visual form: Computational aspects. Space, 1(3), 1995. 3
18. M. Singh, G. Seyranian, and D. Hoffman. Parsing silhouettes: The short-cut rule. Perception and Psychophysics, 61(4):636-660, 1999. 3
19. K. Wu and M. Levine. 3D part segmentation using simulated electrical charge distributions. IEEE Transaction on Pattern Analysis and Machine Intelligence, 19(11):1223-1235, 1997. 3