Efficient simplex computation for fixture layout design

CAD Computer Aided Design

Volumn 43, Issue 10, 2011, Pages 1307-1318

  Zheng, Y ^a   Lin, M C ^a   Manocha, D ^a  

^a University of North Carolina   (United States)

Author keywords

Fixture; Form closure; Layout design; Simplex; Wrench

Indexed keywords

3D MODELS; 3D OBJECT; BRANCH-AND-BOUND ALGORITHMS; COMPUTATION TIME; FIXTURE LAYOUT; FORM-CLOSURE; FUNDAMENTAL TOOLS; LAYOUT DESIGN; LINEAR TIME; LOWER AND UPPER BOUNDS; MULTIPLE CONTACTS; PRACTICAL METHOD; RANDOMIZED ALGORITHMS; REAL-TIME APPLICATION; SIMPLEX; SINGLE VERTEX; WRENCH;

ALGORITHMS; BRANCH AND BOUND METHOD; CONTENT BASED RETRIEVAL; FIXTURES (TOOLING); THREE DIMENSIONAL;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 80052926984     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cad.2011.06.026     Document Type: Conference Paper

References (22)

1. C. Wentink, A.F. van der Stappen, and M.H. Overmars Algorithms for fixture design J.-P. Laumond, M.H. Overmars, Algorithms for robotic motion and manipulation 1996 A.K. Peters, Ltd MA (USA) 321 346
2. Y.M. Rong, S.H. Huang, and Z.K. Hou Advanced computer-aided fixture design 2005 Academic Press MA (USA)
3. R.C. Brost, and K.Y. Goldberg A complete algorithm for designing planar fixtures using modular components IEEE Transactions on Robotics and Automation 12 1 1996 31 46 (Pubitemid 126780446)
4. A.S. Wallack, and J.F. Canny Planning for modular and hybrid fixtures Algorithmica 19 1 1997 40 60 (Pubitemid 127709353)
5. B. Mishra, J.T. Schwarz, and M. Sharir On the existence and synthesis of multifingered positive grips Algorithmica 2 14 1987 541 558 (Pubitemid 18531161)
6. X. Markenscoff, L. Ni, and C.H. Papadimitriou The geometry of grasping International Journal of Robotics Research 9 1 1990 61 74
7. K. Yu, and K.Y. Goldberg A complete algorithm for fixture loading International Journal of Robotics Research 17 11 1998 1214 1224 (Pubitemid 128555583)
8. Y. Zheng, and W.-H. Qian A 3-D modular fixture with enhanced localization accuracy and immobilization capability International Journal of Machine Tools & Manufacture 48 6 2008 677 687
9. A.F. van der Stappen, C. Wentink, and M.H. Overmars Computing immobilizing grasps of polygonal parts International Journal of Robotics Research 19 5 2000 467 479 (Pubitemid 32136608)
10. M.Y. Wang, and D.M. Pelinescu Optimizing fixture layout in a point-set domain IEEE Transactions on Robotics and Automation 17 3 2001 312 323 (Pubitemid 32829738)
11. Y.-H. Liu, M.-L. Lam, and D. Ding A complete and efficient algorithm for searching 3-D form-closure grasps in the discrete domain IEEE Transactions on Robotics 20 5 2004 805 816
12. X.Y. Zhu, and H. Ding An efficient algorithm for grasp synthesis and fixture layout design in discrete domain IEEE Transactions on Robotics 23 1 2007 157 163 (Pubitemid 46443350)
13. T. Watanabe, and T. Yoshikawa Grasping optimization using a required external force set IEEE Transactions on Automation Science and Engineering 4 1 2007 52 66 (Pubitemid 46113499)
14. Y. Zheng, and C.-M. Chew A geometric approach to automated fixture layout design Computer-Aided Design 42 3 2010 202 212
15. Kirkpatrick D, Mishra B, Yap C. Quantitative Steinmetz's theorem with applications to multi-fingered grasping, In: Proceedings of the 22th ACM symposium on theory of computing, 1990, p. 34151.
16. Ferrari C, Canny JF. Planning optimal grasps, In: Proceedings of the IEEE international conference on robotics and automation. 1992, p. 229095.
17. Zheng Y, Lin MC, Manocha D. Efficient simplex computation for fixture layout design, In: Proceedings of the 14th ACM symposium on solid and physical modeling. 2010, p. 7180.
18. P. Gritzmann, V. Klee, and D.G. Larman Largest j-simplices in n-polytopes Discrete and Computational Geometry 13 34 1995 477 515
19. A. Packer Np-hardness of largest contained and smallest containing simplices for V- and H-polytopes Discrete and Computational Geometry 28 3 2002 349 377 (Pubitemid 36165608)
20. A. Brieden, P. Gritzmann, and V. Klee Oracle-polynomial-time approximation of largest simplices in convex bodies Discrete Mathematics 221 13 2000 79 92
21. A. Packer Polynomial-time approximation of largest simplices in V-polytopes Discrete Applied Mathematics 134 13 2004 213 237
22. I. Koutis Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope Information Processing Letters 100 1 2006 8 13 (Pubitemid 43975099)