Touring a Sequence of Orthogonal Polygons

Katrin Casel, Sándor Kisfaludi-Bak, Linda Kleist +3

We study the problem of computing a shortest tour that visits a sequence of $k$ polygons $P_1,\dots ,P_k$ with a total number of $n$ vertices. A tour is an oriented curve such that…