# Economical Delone Sets for Approximating Convex Bodies

Ahmed Abdelkader,
David Mount

June 2018

### Abstract

Convex bodies are ubiquitous in computational geometry and optimization theory. The high combinatorial complexity of multidimensional convex polytopes has motivated the development of algorithms and data structures for approximate representations. This paper demonstrates an intriguing connection between convex approximation and the classical concept of Delone sets from the theory of metric spaces. It shows that with the help of a classical structure from convexity theory, called a Macbeath region, it is possible to construct an epsilon-approximation of any convex body as the union of $O(1/\varepsilon^{(d-1)/2})$ ellipsoids, where the center points of these ellipsoids form a Delone set in the Hilbert metric associated with the convex body. Furthermore, a hierarchy of such approximations yields a data structure that answers epsilon-approximate polytope membership queries in $O(\log(1/\varepsilon)$ time. This matches the best asymptotic results for this problem, by a data structure that both is simpler and arguably more elegant.

Publication

In *Scandinavian Symposium and Workshops on Algorithm Theory*