@InProceedings{arya_et_al:LIPIcs.SoCG.2016.11,
author = {Arya, Sunil and da Fonseca, Guilherme D. and Mount, David M.},
title = {{On the Combinatorial Complexity of Approximating Polytopes}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.11},
URN = {urn:nbn:de:0030-drops-59034},
doi = {10.4230/LIPIcs.SoCG.2016.11},
annote = {Keywords: Polytope approximation, Convex polytopes, Macbeath regions}
}