? Mechanical Assembly Packing Problem Using Joint Constraints
Journal of Computer Science and Technology
Quick Search in JCST
 Advanced Search 
      Home | PrePrint | SiteMap | Contact Us | FAQ
 
Indexed by   SCIE, EI ...
Bimonthly    Since 1986
Journal of Computer Science and Technology 2017, Vol. 32 Issue (6) :1162-1171    DOI: 10.1007/s11390-017-1791-2
Special Section of CAD/Graphics 2017 Current Issue | Archive | Adv Search << Previous Articles | Next Articles >>
Mechanical Assembly Packing Problem Using Joint Constraints
Ming-Liang Xu1, Member, CCF, Ning-Bo Gu1, Wei-Wei Xu2,*, Member, ACM, Ming-Yuan Li1, Member, ACM, Jun-Xiao Xue3, Member, CCF, Bing Zhou1
1 School of Information Engineering, Zhengzhou University, Zhengzhou 450000, China;
2 State Key Laboratory of Computer Aided Design and Computer Graphics, Zhejiang University, Hangzhou 310058, China;
3 School of Software, Zhengzhou University, Zhengzhou 450000, China

Abstract
Reference
Related Articles
Download: [PDF 950KB]     Export: BibTeX or EndNote (RIS)  
Abstract The three-dimensional packing problem is generally on how to pack a set of models into a given bounding box using the smallest packaging volume. It is known as an NP-hard problem. When discussing the packing problem in mechanical field, the space utilization of a mechanism is low due to the constraint of mechanical joints between different mechanical parts. Although such a situation can be improved by breaking the mechanism into components at every joint, it burdens the user when reassembling the mechanism and may also reduce the service life of mechanical parts. In this paper, we propose a novel mechanism packing algorithm that deliberately considers the DOFs (degrees of freedom) of mechanical joints. With this algorithm, we construct the solution space according to each joint. While building the search tree of the splitting scheme, we do not break the joint, but move the joint. Therefore, the algorithm proposed in this paper just requires the minimal number of splits to meet the goal of space utilization. Numerical examples show that the proposed method is convenient and efficient to pack three-dimensional models into a given bounding box with high space utilization.
Articles by authors
KeywordsNP-hard problem   packing problem   search tree     
Received 2017-06-26;
Fund:

The work was supported by the National Key Research and Development Program of China under Grant No. 2017YFC0804401, the National Natural Science Foundation of China under Grant Nos. 61472370, 61672469, 61379079, 61322204, and 61502433, the Natural Science Foundation of Henan Province of China under Grant No. 162300410262, and the Key Research Projects of Henan Higher Education Institutions of China under Grant No. 18A413002.

Corresponding Authors: Wei-Wei Xu     Email: xww@cad.zju.edu.cn
About author: Ming-Liang Xu is a professor in the School of Information Engineering,Zhengzhou University,Zhengzhou,and currently is the director of CⅡSR (Center for Interdisciplinary Information Science Research).His research interests include computer graphics and computer vision.Xu got his Ph.D.degree in computer science and technology,Zhejiang University,Hangzhou,in 2011.
Cite this article:   
Ming-Liang Xu, Ning-Bo Gu, Wei-Wei Xu, Ming-Yuan Li, Jun-Xiao Xue, Bing Zhou.Mechanical Assembly Packing Problem Using Joint Constraints[J]  Journal of Computer Science and Technology, 2017,V32(6): 1162-1171
URL:  
http://jcst.ict.ac.cn:8080/jcst/EN/10.1007/s11390-017-1791-2
Copyright 2010 by Journal of Computer Science and Technology