Capturing points with a rotating polygon (and a 3D extension)
Not on the map. Why?
Abstract (arXiv)
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 line segment, a line, or a polygonal chain. 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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 7 May 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1.
1 paper.
- 2023The Maximum Cover with Rotating Field of Viewcited by 0
- 2023The Maximum Cover with Rotating Field of View27 Sep 2023