Caging Plygons with Two and Three Fingers

Abstract

We study two- and three-finger caging arrangements of planar objects. An object is caged with an arrangement of fixed fingers (as obstacles) when it is impossible to take the object to arbitrary positions far from its initial placement without penetrating any finger. We present algorithms and data structures that compute the set of all possible caging arrangemenets of two and three fingers of planar objects.