Translational polygon containment
Authors: G. Scheithauer, T. Romanova, Y. Stoyan
Preprint MATH-NM-01-2007, Technical University Dresden, 2007.
Appeared in: Journal of Mechanical Engineering 10/3, 67-75 (2007)

In this paper we present a natural and simple procedure to compute all feasible allocation points of a (non-convex) polygon within a (non-convex) polygonal bounded region. This procedure can be seen as a basis of more sophisticated and efficient algorithms for the same task, or for related problems such as finding a single placement point.