Assembling polyhedra with single translations
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2392-2397 vol.3
- https://doi.org/10.1109/robot.1992.220106
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/sup 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/sup 2/n/sup 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.Keywords
This publication has 13 references indexed in Scilit:
- Robot Motion PlanningPublished by Springer Nature ,1991
- Maintaining geometric dependencies in assembly planningPublished by Springer Nature ,1991
- On separating two simple polygons by a single translationDiscrete & Computational Geometry, 1989
- Automatic Generation of Mechanical Assembly SequencesPublished by Defense Technical Information Center (DTIC) ,1988
- Separating two simple polygons by a sequence of translationsDiscrete & Computational Geometry, 1988
- On planning assembliesPublished by Association for Computing Machinery (ACM) ,1988
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- The power of geometric dualityBIT Numerical Mathematics, 1985
- Computational GeometryPublished by Springer Nature ,1985
- On Removing a Ball without Disturbing the OthersMathematics Magazine, 1984