PARALLEL DISASSEMBLY BY ONION PEELING

For some assembly structures, parallel disassembly of components is ne cessary in order to reach a particular internal component. Dice to the large number of possible combinations, the parallel disassembly probl em 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 a n efficient parallel disassembly algorithm. This algorithm rakes Max { O(N-3), 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 resting is incorporated to determine wheth er the query component can be disassembled and moved to infinity witho ut obstruction.