More Examples

The following simple examples illustrate the translational removability problem. Given a set of parts (polygons or polyhedra), decide whether there is a motion (a sequence of arbitrary translations) for separating these parts. Conversely if you think a given set of polygons interlock, output a proof that they indeed interlock.

The animations show a series of problem examples, which have been solved by our program. Click on the images for animation applets.

TIGHT_INFEAS
TIGHT
PISTON



SLIDER
SLIDER_INFEAS
LATCH, LATCH_INFEAS


UNSTACK
SORT_BLOCKS

Back...


F. Schwarzer, 1998-Mar-06