Disassembling a subset of components from an assembly, defined as selective disassembly, often occurs during product de-manufacturing (recycling, reuse and maintenance). Selective disassembly analysis of a product enables quick assessment of the design for de-manufacturing. This paper presents an approach to solve the following selective disassembly problem: given an assembly of n components and s (

Disassembling a selected component from an assembly, defined as selective disassembly, is important for applications such as maintenance, recycling and reuse. This paper presents a geometric algorithm to solve the following selective disassembly problem: given an assembly and a selected component to be disassembled, determine the disassembly sequence with minimum component removals (motions), defined as an optimum sequence. We propose an abstraction “wave propagation” that analyzes the assembly from the selected component outwards, and orders the components for selective disassembly. The main contributions of this research are: (1) determining an optimal disassembly sequence; (2) reducing the search space by analyzing a subset of components in the assembly; and (3) providing a polynomial average complexity algorithm. The proposed selective disassembly approach applies to both two dimensional and three-dimensional assemblies.