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.

1.
Baumgart, B. G., 1972, “Winged Edge Polyhedron Representation,” Stanford University Department of Computer Science, Stanford Technical Report No. CS-72-320.
2.
De Floriani, L., and Nagy, G., 1989, “A Graph Model for Face-to-Face Assembly,” Proc. of IEEE Conference on Robotics and Automation, Vol. 1, pp. 75–78.
3.
Dehne
P.
, and
Sack
J. R.
,
1987
, “
Translation Separability of Sets of Polygons
,”
The Visual Computer
, Vol.
3
, pp.
227
235
.
4.
Dutta, D., and Woo, Anthony C., 1992, “Algorithms for Multiple Disassembly and Parallel Assemblies,” ASME Concurrent Engineering, PED-Vol. 59, pp. 257–266.
5.
Homen de Mello
L. S.
, and
Sanderson
A. C.
,
1990
, “
And/Or Graph Representation of Assembly Plans
,”
IEEE Transactions on Robotics and Automation
, Vol.
6
, No.
2
, pp.
188
199
.
6.
Lee
S.
, and
Shin
Y. G.
,
1990
, “
Assembly Planning Based on Geometric Reasoning
,”
Computers and Graphics
, Vol.
14
, No.
2
, pp.
237
250
.
7.
Lee, S., and Wang, F. C., 1993, “Physical Reasoning of Interconnection Forces for Efficient Assembly Planning,” Proc. of IEEE Conference on Robotics and Automation, Vol. 2, pp. 307–313.
8.
Sack
J. R.
, and
Toussaint
G. T.
,
1987
, “
Separability of Pairs of Polygons Through Single Translations
,”
Robotica
, Vol.
5
, pp.
55
63
.
9.
Toussaint
G. T.
,
1989
, “
On Separating Two Single Polygons by a Single Translation
,”
Discrete and Computational Geometry
, Vol.
4
, No.
3
, pp.
265
278
.
10.
Woo
T. C.
, and
Dutta
D.
,
1991
, “
Automatic Disassembly and Total Ordering in Three Dimensions
,”
ASME Journal of Engineering for Industry
, Vol.
113
, pp.
207
213
.
This content is only available via PDF.
You do not currently have access to this content.