An Integer Programming Formulation Using Convex Polygons for the Convex Partition Problem - Archive ouverte HAL Accéder directement au contenu
Proceedings/Recueil Des Communications Année : 2021

An Integer Programming Formulation Using Convex Polygons for the Convex Partition Problem

Résumé

A convex partition of a point set P in the plane is a planar partition of the convex hull of P into empty convex polygons or internal faces whose extreme points belong to P. In a convex partition, the union of the internal faces give the convex hull of P and the interiors of the polygons are pairwise disjoint. Moreover, no polygon is allowed to contain a point of P in its interior. The problem is to find a convex partition with the minimum number of internal faces. The problem has been shown to be NP-hard and was recently used in the CG:SHOP Challenge 2020. We propose a new integer linear programming (IP) formulation that considerably improves over the existing one. It relies on the representation of faces as opposed to segments and points. A number of geometric properties are used to strengthen it. Data sets of 100 points are easily solved to optimality and the lower bounds provided by the model can be computed up to 300 points.
Fichier non déposé

Dates et versions

hal-04015687 , version 1 (06-03-2023)

Identifiants

Citer

Hadrien Cambazard, Nicolas Catusse. An Integer Programming Formulation Using Convex Polygons for the Convex Partition Problem. 189, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, pp.20:1--20:13, 2021, ⟨10.4230/LIPIcs.SoCG.2021.20⟩. ⟨hal-04015687⟩
9 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More