Euclidean TSP on two polygons

We give an O(n2 m + nm2 + m2 log m) time and O(n2 + m2 ) space algorithm for finding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles in the Euclidean plane, where n and m are the number of vertices of the two polygons.

• Type: Journal
• Year: 2010
• Where: TCS
• Authors: Jeff Abrahamson, Ali Shokoufandeh
• Keywords: Euclidean Plane, Simple Polygonal Obstacles, Space Algorithm, TCS 2010, Theoretical Computer Science