Catching a Polygonal Fish with a Minimum Net

Given a polygon $P$ in the plane that can be translated, rotated and enlarged arbitrarily inside a unit square, the goal is to find a set of lines such that at least one of them always hits $P$ and the number of lines is minimized. We prove the solution is always a regular grid or a set of equidista...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Aghamolaei, Sepideh
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Geometry
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!