SCG '88 Proceedings of the fourth annual symposium on Computational geometry
The robotics review 1
On translating a set of rectangles
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Video: objects that cannot be taken apart with two hands
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Piecewise linear paths among convex obstacles
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
GASP: a system to facilitate animating geometric algorithms
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Assembly sequencing with toleranced parts
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
On the complexity of one-shot translational separability
Information Processing Letters
Visualization of Geometric Algorithms
IEEE Transactions on Visualization and Computer Graphics
GASP: a system for visualizing geometric algorithms
VIS '94 Proceedings of the conference on Visualization '94
Interactive 3D rapid-prototyping models
I3D '12 Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games
| Hi-index | 0.00 |
It has been conjectured that every configuration C of convex objects in 3-space with disjoint interiorscan be taken apart by translation with two hands: that is, some propersubset of C can be translated to infinity withoutdisturbing its complement. We show that the conjecture holds for five orfewer objects and give a counterexample with six objects. We extend thecounterexample to a configuration that cannot be taken apart with twohands using arbitrary isometries (rigid motions).