We study the problem of rotating a simple polygon to contain the maximum number of elements from a given point set in the plane. We consider variations of this problem where the rotation center is a given point or lies on a segment or a line. We also solve an extension to 3D where we rotate a polyhedron around a given point to contain the maximum number of elements from a set of points in the space.

This is a post-peer-review, pre-copyedit version of an article published in Theory of computing systems: an international journal. The final authenticated version is available online at: http://dx.doi.org/10.1007/s00224-018-9885-y