This content is not included in
your SAE MOBILUS subscription, or you are not logged in.
Automatic Disassembly
Annotation ability available
Sector:
Language:
English
Abstract
Disassembly is studied with applications to design evaluation (by computing the direction of access and the number of component removals) and to automatic assembly (by reversing a disassembly sequence for the entire assembly). An algorithm for constructing a Disassembly Tree that yields a minimal sequence of linear motions for a robot is presented. It is shown that the Disassembly Tree can be constructed in time proportional to the number of edges in a planar assembly.
Authors
Citation
Woo, T., "Automatic Disassembly," SAE Technical Paper 870896, 1987, https://doi.org/10.4271/870896.Also In
References
- Wolter, J.D. Volz, R.A. Woo, T.C. “Automatic Generation of Gripping Positions” IEEE Trans, on Systems, Man and Cybernetics SMC-15 2 1985 204 213
- Lee, D.T. Preparata, F.P. “An Optimal Algorithm for Finding the Kernel of a Polygon” Journal of the ACM 26 1979 415 421
- Woo, T.C. “A Combinatorial Analysis of Boundary Data Structure Schemata” IEEE Computer Graphics & Applications 5 3 1985 19 27
- Preparata, F.P. Supowit, K. “Testing a Simple Polygon for Monotonicity” Information Processing Letters 12 4 1981 161 163
- Toussaint, G.T. ElGindy, H.A. “Separation of two Monotone Polygons in Linear Time” Robotica 2 4 1984 215 220