Capturing points with a rotating polygon (and a 3D extension)

05/07/2018
by   Carlos Alegría-Galicia, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/27/2019

Computing a Geodesic Two-Center of Points in a Simple Polygon

Given a simple polygon P and a set Q of points contained in P, we consid...
research
03/17/2023

Connectivity with uncertainty regions given as line segments

For a set Q of points in the plane and a real number δ≥ 0, let 𝔾_δ(Q) be...
research
09/02/2020

Turning machines

Molecular robotics is challenging, so it seems best to keep it simple. W...
research
11/11/2022

Peeling Sequences

Given an n-element point set in the plane, in how many ways can it be pe...
research
05/10/2022

On the Distribution function of area and perimeter for planar poisson line process

The challenges of examining random partitions of space are a significant...
research
04/01/2018

Assigning Weights to Minimize the Covering Radius in the Plane

Given a set P of n points in the plane and a multiset W of k weights wit...
research
02/16/2018

Generalized kernels of polygons under rotation

Given a set O of k orientations in the plane, two points inside a simple...

Please sign up or login with your details

Forgot password? Click here to reset