License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SOCG.2015.44
URN: urn:nbn:de:0030-drops-51019
URL: http://drops.dagstuhl.de/opus/volltexte/2015/5101/
Go to the corresponding LIPIcs Volume Portal


Mulzer, Wolfgang ; Stein, Yannik

Computational Aspects of the Colorful Carathéodory Theorem

pdf-format:
18.pdf (0.6 MB)


Abstract

Let P_1,...,P_{d+1} be d-dimensional point sets such that the convex hull of each P_i contains the origin. We call the sets P_i color classes, and we think of the points in P_i as having color i. A colorful choice is a set with at most one point of each color. The colorful Caratheodory theorem guarantees the existence of a colorful choice whose convex hull contains the origin. So far, the computational complexity of finding such a colorful choice is unknown. We approach this problem from two directions. First, we consider approximation algorithms: an m-colorful choice is a set that contains at most m points from each color class. We show that for any fixed epsilon > 0, an (epsilon d)-colorful choice containing the origin in its convex hull can be found in polynomial time. This notion of approximation has not been studied before, and it is motivated through the applications of the colorful Caratheodory theorem in the literature. In the second part, we present a natural generalization of the colorful Caratheodory problem: in the Nearest Colorful Polytope problem (NCP), we are given d-dimensional point sets P_1,...,P_n that do not necessarily contain the origin in their convex hulls. The goal is to find a colorful choice whose convex hull minimizes the distance to the origin. We show that computing local optima for the NCP problem is PLS-complete, while computing a global optimum is NP-hard.

BibTeX - Entry

@InProceedings{mulzer_et_al:LIPIcs:2015:5101,
  author =	{Wolfgang Mulzer and Yannik Stein},
  title =	{{Computational Aspects of the Colorful Carath{\'e}odory Theorem}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{44--58},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Lars Arge and J{\'a}nos Pach},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5101},
  URN =		{urn:nbn:de:0030-drops-51019},
  doi =		{10.4230/LIPIcs.SOCG.2015.44},
  annote =	{Keywords: colorful Carath{\'e}odory theorem, high-dimensional approximation, PLS}
}

Keywords: colorful Carathéodory theorem, high-dimensional approximation, PLS
Seminar: 31st International Symposium on Computational Geometry (SoCG 2015)
Issue Date: 2015
Date of publication: 11.06.2015


DROPS-Home | Fulltext Search | Imprint Published by LZI