Optimal Bound on the Combinatorial Complexity of Approximating Polytopes

DOI10.1145/3559106arXiv1910.14459OpenAlexW4295128493MaRDI QIDQ6058263

Rahul Arya, David M. Mount, Sunil Arya, Guilherme Dias da Fonseca

Publication date: 31 October 2023

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.14459

zbMATH Keywords

convex polytopespolytope approximationmacbeath regions

Mathematics Subject Classification ID

Computer science (68-XX)

This page was built for publication: Optimal Bound on the Combinatorial Complexity of Approximating Polytopes