Computing nonsimple polygons of minimum perimeter

DOI10.20382/JOCG.V8I1A13zbMATH Open1393.68174arXiv1603.07077OpenAlexW2760814065MaRDI QIDQ5745396FDOQ5745396

Authors:

Publication date: 5 June 2018

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1603.07077

Recommendations

• Computing area-optimal simple polygonizations
• Minimum-perimeter intersecting polygons
• Minimum-perimeter enclosures
• Minimum-perimeter intersecting polygons
• Optimal area polygonization problems: exact solutions through geometric duality

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cited In (6)

• Area-Optimal Simple Polygonalizations: The CG Challenge 2019
• Solving the minimum convex partition of point sets with integer programming
• Minimum-perimeter intersecting polygons
• Title not available (Why is that?)
• Ailsa H. Land and her 1979 study of the traveling salesman problem: personal reminiscences and historical remarks
• Title not available (Why is that?)

This page was built for publication: Computing nonsimple polygons of minimum perimeter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5745396)