| contributor author | Shiang-Fong Chen | |
| contributor author | Shuo-Yan Chou | |
| contributor author | Lin-Lin Chen | |
| contributor author | J. H. Oliver | |
| date accessioned | 2017-05-08T23:54:15Z | |
| date available | 2017-05-08T23:54:15Z | |
| date copyright | June, 1997 | |
| date issued | 1997 | |
| identifier issn | 1050-0472 | |
| identifier other | JMDEDB-27645#267_1.pdf | |
| identifier uri | http://yetl.yabesh.ir/yetl/handle/yetl/119134 | |
| description abstract | For some assembly structures, parallel disassembly of components is necessary in order to reach a particular internal component. Due to the large number of possible combinations, the parallel disassembly problem is not easily solved in a general form. In order to reduce the time complexity of finding a disassembly sequence, this paper introduces a simplified mating graph and develops a data structure to facilitate an efficient parallel disassembly algorithm. This algorithm takes Max {O(N3 ), O(E)} time to find an efficient sequence to reach a particular component, where N is the number of components and E is the number of mating faces. Separability testing is incorporated to determine whether the query component can be disassembled and moved to infinity without obstruction. | |
| publisher | The American Society of Mechanical Engineers (ASME) | |
| title | Parallel Disassembly by Onion Peeling | |
| type | Journal Paper | |
| journal volume | 119 | |
| journal issue | 2 | |
| journal title | Journal of Mechanical Design | |
| identifier doi | 10.1115/1.2826246 | |
| journal fristpage | 267 | |
| journal lastpage | 274 | |
| identifier eissn | 1528-9001 | |
| keywords | Manufacturing | |
| keywords | Algorithms AND Testing | |
| tree | Journal of Mechanical Design:;1997:;volume( 119 ):;issue: 002 | |
| contenttype | Fulltext | |
