Touring a sequence of disjoint polygons: Complexity and extension

In the Touring Polygons Problem (TPP) there is a start point s, a sequence of simple polygons P=(P1,…,Pk) and a target point t in the plane. The goal is to obtain a path of minimum possible length that starts from s, visits in order each of the polygons in P and ends at t. This problem was introduce...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science 2014-10, Vol.556, p.45-54
Hauptverfasser:	Ahadi, Arash, Mozafari, Amirhossein, Zarei, Alireza
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Complement Complexity Mathematical analysis Norms Polygons Polynomials Segments Shortest path Touring polygons
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!