Computing Nonsimple Polygons of Minimum Perimeter
- 868 Downloads
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 vertices in the plane, the problem Minimum Perimeter Polygon (MPP) asks for a (not necessarily simply connected) polygon with shortest possible boundary length. 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 MPP. On the positive side, we show how to achieve a constant-factor approximation.
When trying to solve MPP instances to provable optimality by means of 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 additional 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 using a natural geometry-based sparsification yields results that are on average within 0.5 % of the optimum.
KeywordsTraveling Salesman Problem (TSP) Minimum Perimeter Polygon (MPP) Curve reconstruction NP-hardness Exact optimization Integer programming Computational geometry meets combinatorial optimization
We thank Stephan Friedrichs and Melanie Papenberg for helpful conversations. Parts of this work were carried out at the 30th Bellairs Winter Workshop on Computational Geometry (Barbados) in 2015. We thank the workshop participants and organizers, particularly Erik Demaine. Joseph Mitchell is partially supported by NSF (CCF-1526406). Irina Kostitsyna is supported by the Netherlands Organisation for Scientific Research (NWO) under project no. 639.023.208.
- 2.Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: On the solution of traveling salesman problems. Documenta Mathematica – Journal der DeutschenMathematiker-Vereinigung, ICM, pp. 645–656 (1998)Google Scholar
- 6.Christofides, N.: Worst-case analysis of a new heuristic for the Travelling Salesman Problem, Technical report 388, Graduate School of Industrial Administration, CMU (1976)Google Scholar
- 11.Fekete, S.P., Friedrichs, S., Hemmer, M., Papenberg, M., Schmidt, A., Troegel, J.: Area- and boundary-optimal polygonalization of planar point sets. In: EuroCG 2015, pp. 133–136 (2015)Google Scholar
- 12.Fekete, S.P., Haas, A., Hemmer, M., Hoffmann, M., Kostitsyna, I., Krupke, D., Maurer, F., Mitchell, J.S.B., Schmidt, A., Schmidt, C., Troegel, J.: Computing nonsimple polygons of minimum perimeter. CoRR, abs/1603.07077 (2016)Google Scholar
- 13.Giesen, J.: Curve reconstruction, the traveling salesman problem and Menger’s theorem on length. In: Proceedings of 15th Annual Symposium on Computational Geometry (SoCG), pp. 207–216 (1999)Google Scholar
- 16.Jünger, M., Reinelt, G., Rinaldi, G.: The traveling salesman problem. In: Handbooks in Operations Research and Management Science, vol. 7, pp. 225–330 (1995)Google Scholar
- 17.Land, A.: The solution of some 100-city Travelling Salesman Problems, Technical report, London School of Economics (1979)Google Scholar
- 22.Pferschy, U., Stanek, R.: Generating subtour constraints for the TSP from pure integer solutions. Department of Statistics and Operations Research, University of Graz, Technical report (2014)Google Scholar
- 24.Wein, R., Berberich, E., Fogel, E., Halperin, D., Hemmer, M., Salzman, O., Zukerman, B.: 2D arrangements. In: CGAL User and Reference Manual, 4.3rd edn. CGAL Editorial Board (2014)Google Scholar