Finding stable subassemblies with backtracking divide and conquer on strongly connected components

This paper presents a fast algorithm which is able to determine all subassemblies of a product stable in themselves. It is based upon previous considerations by Hoehmann et al. concerning a mathematical model to deduce and prove such algorithms. That model reflects the conditions for stability and furthermore serves as a foundation for providing several properties every decomposition of a product into stable subassemblies has to consider. Based upon these properties a class of algorithms is declared guaranteed to stretch the whole solution space of stable subassemblies. The presented algorithm belongs to that class and serves as an example. It uses geometric features of parts and effects of connections as input to internally decompose a product into stable subassemblies