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 polyhe...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theory of computing systems Ročník 63; číslo 3; s. 543 - 566
Hlavní autoři: Alegría-Galicia, Carlos, Orden, David, Palios, Leonidas, Seara, Carlos, Urrutia, Jorge
Médium: Journal Article Publikace
Jazyk:angličtina
Vydáno: New York Springer US 01.04.2019
Springer Nature B.V
Témata:
11 Number theory
11C Polynomials and matrices
26 Real functions
26C Polynomials, rational functions
Anàlisi matemàtica
Classificació AMS
Computer Science
Geometric optimization
Matemàtiques i estadística
Points covering
Polinomis
Polygon
Polyhedron
Polynomials
Rotation
Teoria de nombres
Theory of Computation
Àlgebra
Àrees temàtiques de la UPC
Polyhedron
Geometric optimization
Points covering
Polygon
Rotation
ISSN:1432-4350, 1433-0490, 1433-0490
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1432-4350
1433-0490
1433-0490
DOI:10.1007/s00224-018-9885-y