Computing Nonsimple Polygons of Minimum Perimeter

• Published in: Journal of computational geometry Vol. 8; no. 1
• Main Authors: Fekete, Sándor P., Haas, Andreas, Hemmer, Michael, Hoffmann, Michael, Kostitsyna, Irina, Krupke, Dominik, Maurer, Florian, Mitchell, Joseph S.B., Schmidt, Arne, Schmidt, Christiane, Troegel, Julian
• Format: Journal Article
• Language: English
• Published: 2017
• ISSN: 1920-180X; 1920-180X
• DOI: 10.20382/jocg.v8i1a13

We consider the Minimum Perimeter Polygon Problem (MP3): for a given set V of points in the plane, find a polygon P with holes that has vertex set V , such that the total boundary length is smallest possible. The MP3 can be considered a natural geometric generalization of the Traveling Salesman Problem (TSP), which asks for a simple polygon with minimum perimeter. Just like the TSP, the MP3 occurs naturally in the context of curve reconstruction. Even though the closely related problem of finding a minimum cycle cover is polynomially solvable by matching techniques, we prove how the topological structure of a polygon leads to NP-hardness of the MP3. On the positive side, we provide constant-factor approximation algorithms. In addition to algorithms with theoretical worst-case guarantess, we provide practical methods for computing provably optimal solutions for relatively large instances, based on integer programming. An additional difficulty compared to the TSP is the fact that only a subset of subtour constraints is valid, depending not on combinatorics, but on geometry. We overcome this difficulty by establishing and exploiting geometric properties. This allows us to reliably solve a wide range of benchmark instances with up to 600 vertices within reasonable time on a standard machine. We also show that restricting the set of connections between points to edges of the Delaunay triangulation yields results that are on average within 0.5% of the optimum for large classes of benchmark instances.