Document Type

Article

Publication Date

6-1-1997

Journal or Book Title

Journal of Mechanical Design

Volume

119

Issue

2

First Page

267

Last Page

274

DOI

10.1115/1.2826246

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.

Comments

This article is from Journal of Mechanical Design 119 (1997): 267–274, doi:10.1115/1.2826246. Posted with permission.

Copyright Owner

American Society of Mechanical Engineering

Language

en

File Format

application/pdf

Included in

Manufacturing Commons

Share

COinS