## Abstract

The problem of partitioning an assembly of polyhedral objects into two subassemblies that can be separated arises in assembly planning. The authors describe an algorithm to compute the set of all translations separating two polyhedra with n vertices in O(n^{4}) steps and show that this is optimal. Given an assembly of k polyhedra with a total of n vertices, an extension of this algorithm identifies a valid translation and removable subassembly in O(k^{2}n^{4}) steps if one exists. Based on the second algorithm, a polynomial time method for finding a complete assembly sequence consisting of single translations is derived. An implementation incorporates several changes to achieve better average-case performances. Experimental results obtained for composite objects consisting of isothetic polyhedra are described.

Original language | English |
---|---|

Pages | 2392-2397 |

Number of pages | 6 |

Publication status | Published - 01.12.1992 |

Event | Proceedings of the 1992 IEEE International Conference on Robotics and Automation - Nice, France Duration: 12.05.1992 → 14.05.1992 Conference number: 17601 |

### Conference

Conference | Proceedings of the 1992 IEEE International Conference on Robotics and Automation |
---|---|

Country/Territory | France |

City | Nice |

Period | 12.05.92 → 14.05.92 |