English

Optimized Synthesis of Snapping Fixtures

Computational Geometry 2020-05-19 v2 Robotics

Abstract

Fixtures for constraining the movement of parts have been extensively investigated in robotics, since they are essential for using robots in automated manufacturing. This paper deals with the design and optimized synthesis of a special type of fixtures, which we call \emph{snapping fixtures}. Given a polyhedral workpiece PP with nn vertices and of constant genus, which we need to hold, a snapping fixture is a semi-rigid polyhedron GG, made of a palm and several fingers, such that when PP and GG are well separated, we can push PP toward GG, slightly bending the fingers of GG on the way (exploiting its mild flexibility), and obtain a configuration, where GG is back in its original shape and PP and GG are inseparable as rigid bodies. We prove the minimal closure conditions under which such fixtures can hold parts, using Helly's theorem. We then introduce an algorithm running in O(n3)O(n^3) time that produces a snapping fixture, minimizing the number of fingers and optimizing additional objectives, if a snapping fixture exists. We also provide an efficient and robust implementation of a simpler version of the algorithm, which produces the fixture model to be 3D printed and runs in O(n4)O(n^4) time. We describe two applications with different optimization criteria: Fixtures to hold add-ons for drones, where we aim to make the fixture as lightweight as possible, and small-scale fixtures to hold precious stones in jewelry, where we aim to maximize the exposure of the stones, namely minimize the obscuring of the workpiece by the fixture.

Keywords

Cite

@article{arxiv.1909.05953,
  title  = {Optimized Synthesis of Snapping Fixtures},
  author = {Tom Tsabar and Efi Fogel and Dan Halperin},
  journal= {arXiv preprint arXiv:1909.05953},
  year   = {2020}
}
R2 v1 2026-06-23T11:14:02.895Z