Translation separability of sets of polygons
The Visual Computer , Volume 3 - Issue 4 p. 227- 235
We consider the problem of separating a set of polygons by a sequence of translations (one such collision-free translation motion for each polygon). If all translations are performed in a common direction the separability problem so obtained has been referred to as the uni-directional separability problem; for different translation directions, the more general multi-directional separability problem arises. The class of such separability problems has been studied previously and arises e.g. in computer graphics and robotics. Existing solutions to the uni-directional problem typically assume the objects to have a certain predetermined shape (e.g., rectangular or convex objects), or to have a direction of separation already available. Here we show how to compute all directions of unidirectional separability for sets of arbitrary simple polygons. The problem of determining whether a set of polygons is multi-directionally separable had been posed by G.T. Toussaint. Here we present an algorithm for solving this problem which, in addition to detecting whether or not the given set is multidirectionally separable, also provides an ordering in which to separate the polygons. In case that the entire set is not multi-directionally separable, the algorithm will find the largest separable subset.
|Computational geometry, Data structures, Motion problems, Separability|
|The Visual Computer|
|Organisation||School of Computer Science|
Dehne, F, & Sack, J.-R. (1987). Translation separability of sets of polygons. The Visual Computer, 3(4), 227–235. doi:10.1007/BF01952829