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

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.

Description

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

CitationAlegría-Galicia , C. [et al.]. Capturing points with a rotating polygon (and a 3D extension). "Theory of computing systems: an international journal", Abril 2019, vol. 63, núm. 3, p. 543-566.

URIhttp://hdl.handle.net/2117/171445

DOI10.1007/s00224-018-9885-y

ISSN1433-0490

Publisher versionhttps://link.springer.com/article/10.1007%2Fs00224-018-9885-y

Other identifiershttps://arxiv.org/pdf/1805.02570.pdf

Collections

View Usage Statistics

Show full item record

Files	Description	Size	Format	View
points_covering.pdf		640,4Kb	PDF	View/Open

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder

UPCommons. Global access to UPC knowledge

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

View/Open

Browse