Computing Nonsimple Polygons of Minimum Perimeter

Sándor P. Fekete, Andreas Haas, Michael Hemmer +8

We provide exact and approximation methods for solving a geometric relaxation of the Traveling Salesman Problem (TSP) that occurs in curve reconstruction: for a given set of vertic…