Algorithm for Multiple Disassembly and Parallel Assemblies
Authors:
- 1 February 1995
- journal article
- Published by ASME International in Journal of Engineering for Industry
- Vol. 117 (1) , 102-109
Abstract
We consider the geometric problem of generating efficient sequences for disassembling components. First, a classification of assemblies is proposed based on logical, dimensional and geometric complexities, and a simple method is outlined for recognizing parallel and sequential assemblies. Next, an efficient algorithm is outlined for removing multiple components from an assembly. Finally, we consider parallel assemblies and outline two algorithms for their disassembly.Keywords
This publication has 10 references indexed in Scilit:
- Computational Geometry on the Sphere With Application to Automated MachiningJournal of Mechanical Design, 1992
- Automatic Disassembly and Total Ordering in Three DimensionsJournal of Engineering for Industry, 1991
- A correct and complete algorithm for the generation of mechanical assembly sequencesIEEE Transactions on Robotics and Automation, 1991
- Representations of mechanical assembly sequencesIEEE Transactions on Robotics and Automation, 1991
- An integrated computer aid for generating and evaluating assembly sequences for mechanical productsIEEE Transactions on Robotics and Automation, 1991
- Simplified generation of all mechanical assembly sequencesIEEE Journal on Robotics and Automation, 1987
- Automatic assembling procedure generation from mating conditionsComputer-Aided Design, 1987
- A Combinatorial Analysis of Boundary Data Structure SchemataIEEE Computer Graphics and Applications, 1985
- A constant expected time, linear storage data structure for representing three-dimensional objectsIEEE Transactions on Systems, Man, and Cybernetics, 1984
- On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal BarriersThe International Journal of Robotics Research, 1983