Objects that cannot be taken apart with two hands
In the Euclidean plane any configuration of convex objects can be easily ``taken apart by translation with two hands. It has been conjectured that every configuration \(C\) of convex objects (bounded point sets) in Euclidean 3-space with disjoint interiors can be taken apart in the same sense: this is, some proper subsets of \(C\) can be translated to infinity without disturbing its complement. The authors show that this conjecture holds for five or fewer objects. Using symmetry groups they give a counterexample with six objects (tetrahedra). They finally extend the counterexample to a configuration (of 30 convex sticks) that cannot be taken apart with two hands using arbitrary isometries. These questions have applications in the fields of mechanical assembly planning, robotic manipulation, and computer graphics.
- Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes
- On the complexity of one-shot translational separability.
- On the separability of quadrilaterals in the plane by translations and rotations
- Publication:3484389
- scientific article; zbMATH DE number 797431
- scientific article; zbMATH DE number 3854804 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3241098 (Why is no real title available?)
- scientific article; zbMATH DE number 3345859 (Why is no real title available?)
- scientific article; zbMATH DE number 3192616 (Why is no real title available?)
- Objects that cannot be taken apart with two hands
- On Removing a Ball without Disturbing the Others
- On the existence and synthesis of multifinger positive grips
- PLANAR POINT LOCATION REVISITED
- On the complexity of assembly partitioning
- Objects that cannot be taken apart with two hands
- Interlocked open and closed linkages with few joints.
- On the complexity of one-shot translational separability.
- Assembly sequences for polyhedra
- Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes
- scientific article; zbMATH DE number 797431 (Why is no real title available?)
- Intractability of assembly sequencing: unit disks in the plane
- Physically feasible decomposition of Engino{\circledR} toy models: a graph-theoretic approach
- Throwing a sofa through the window
- Optimal algorithms for separating a polyhedron from its single-part mold
- Partitioning a planar assembly into two connected parts is NP-complete
- Throwing a sofa through the window
This page was built for publication: Objects that cannot be taken apart with two hands
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1338963)