AI Chat AI Image Generator AI Video Text to Speech

Minimum Convex Partition of Point Sets is NP-Hard

11/18/2019

∙

by Nicolas Grelier, et al.

∙

∙

Given a point set P, are k closed convex polygons sufficient to partition the convex hull of P, such that the interior of a convex set contains no point in P? What if the vertices of these polygons are constrained to be points of P? We show that the first decision problem is NP-hard, and the second NP-complete.

page 1

page 2

page 3

page 4

research

∙ 11/22/2017

Shellability is NP-complete

We prove that for every d≥ 2, deciding if a pure, d-dimensional, simplic...

0 Xavier Goaoc, et al. ∙

research

∙ 03/29/2021

The Inverse Problems of some Mathematical Programming Problems

The non-convex quadratic orogramming problem and the non-monotone linear...

0 Siming Huang, et al. ∙

research

∙ 05/09/2018

On the number of integer points in translated and expanded polyhedra

We prove that the problem of minimizing the number of integer points inp...

0 Danny Nguyen, et al. ∙

research

∙ 09/06/2022

Well-Separation and Hyperplane Transversals in High Dimensions

A family of k point sets in d dimensions is well-separated if the convex...

0 Helena Bergold, et al. ∙

research

∙ 11/15/2022

Complexity Results for Implication Bases of Convex Geometries

A convex geometry is finite zero-closed closure system that satisfies th...

0 Todd Bichoupan, et al. ∙

research

∙ 10/01/2018

Minimum-Link Rectilinear Covering Tour is NP-hard in R^4

Given a set P of n points in R^d, a tour is a closed simple path that co...

0 Bhadrachalam Chitturi, et al. ∙

research

∙ 07/02/2020

A Fully Polynomial Time Approximation Scheme For A NP-Hard Problem

We present a novel feasibility criteria for the intersection of convex s...

0 Marius-Simion Costandin, et al. ∙