License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2014.578
URN: urn:nbn:de:0030-drops-44890
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2014/4489/
Go to the corresponding LIPIcs Volume Portal


Mustafa, Nabil H. ; Ray, Saurabh

Near-Optimal Generalisations of a Theorem of Macbeath

pdf-format:
47.pdf (0.6 MB)


Abstract

The existence of Macbeath regions is a classical theorem in convex geometry ("A Theorem on non-homogeneous lattices", Annals of Math, 1952). We refer the reader to the survey of I. Barany for several applications. Recently there have been some striking applications of Macbeath regions in discrete and computational geometry.

In this paper, we study Macbeath's problem in a more general setting, and not only for the Lebesgue measure as is the case in the classical theorem. We prove near-optimal generalizations for several basic geometric set systems. The problems and techniques used are closely linked to the study of espilon-nets for geometric set systems.

BibTeX - Entry

@InProceedings{mustafa_et_al:LIPIcs:2014:4489,
  author =	{Nabil H. Mustafa and Saurabh Ray},
  title =	{{Near-Optimal Generalisations of a Theorem of Macbeath}},
  booktitle =	{31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
  pages =	{578--589},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-65-1},
  ISSN =	{1868-8969},
  year =	{2014},
  volume =	{25},
  editor =	{Ernst W. Mayr and Natacha Portier},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2014/4489},
  URN =		{urn:nbn:de:0030-drops-44890},
  doi =		{10.4230/LIPIcs.STACS.2014.578},
  annote =	{Keywords: Epsilon Nets, Cuttings, Union Complexity, Geometric Set systems, Convex Geometry}
}

Keywords: Epsilon Nets, Cuttings, Union Complexity, Geometric Set systems, Convex Geometry
Collection: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Issue Date: 2014
Date of publication: 05.03.2014


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI