@InProceedings{mustafa_et_al:LIPIcs.STACS.2014.578,
author = {Mustafa, Nabil H. and Ray, Saurabh},
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 = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.578},
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}
}